Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
3Activity

Table Of Contents

Chapter 1. INTRODUCTION
Chapter 2. BACKGROUND AND REVIEW OF LITERATURE
3.4.1 Inheritance
3.4.2 Abstraction, encapsulation, separation of concerns
3.4.3 Design patterns
Chapter 4. ANALYSIS AND DESIGN
- Allocation of container objects in shared memory
- Allocation of container’s contents in shared memory
4.2.1 Allocation of container objects in shared memory
4.2.2 Allocation of container’s contents in shared memory
4.2.3 Coherence of internal data structures between processes
4.2.4 Container attachment from a non-creating process
4.2.5 Reference safety
4.2.6 Concurrent access safety
4.4 Approach
4.5 Detailed design
4.5.1 Overview
4.5.2 Low level use cases
4.5.3 High-level classes – shared containers and class factories
4.5.4 Process flows
Chapter 5. METHODS AND REALIZATION
5.1 Methodology
5.2 Iterative design steps
5.3 Shared containers library source code
5.3.1 Naming conventions
5.3.2 Structure of library and header files
5.3.3 Interface to shared memory – pointer consistency
5.3.4 Object instantiation and attachment – map of shared containers
Listing 1: The shared_object sub-class of shared_pool
Listing 2: Declaration of the the shared container map
Listing 3: Shared heap header structure and the get_params method
5.3.5 Synchronization
5.3.6 Reference safety
5.4 Verification and validation
5.4.1 Unit testing
5.4.2 Test scaffolding
Chapter 6. RESULTS AND EVALUATION
6.1 Functional evaluation
6.2 Performance evaluation
6.3 Concurrency issues
7.3 Future Activity
7.4 Prospects for Further Work
REFRENCES CITED
A.1 Introduction to the Shared Containers Library
A.2 Shared heap parameters
A.3 sync
A.4 shared_vector<T >
A.5 shared_stack<T, Sequence >
A.6 shared_map <Key, Data, Compare>
A.7 shared_hash_set <Key, Compare>
A.8 SharedVectorFactory<T >
A.9 SharedStackFactory<T , Sequence>
A.10 SharedMapFactory map<Key, Data, Compare>
A.11 SharedHashSetFactory set<Key, Compare>
Appendix B. SHARED CONTAINERS LIBRARY SOURCE CODE
B.1 safe_counter.h
B.2 sync.h
Listing 5: sync.h
B.3 sync.cpp
B.4 heap_parameters.h
Listing 7: heap_parameters.h
B.5 shared_heap.h
Listing 8: shared_heap.h
B.6 shared_heap.cpp
B.7 shared_pool.h
Listing 10: shared_pool.h
B.8 shared_pool.cpp
Listing 11: shared_pool.cpp
B.9 shared_allocator.h
B.10 container_factories.h
B.12 shared_stack.h
B.13 shared_set.h
Listing 16: shared_set.h
B.14 shared_hash_map.h
Appendix C. PERFORMANCE EVALUATION RESULTS
Appendix D. TEST SCAFFOLDING SOURCE CODE
D.1 VectorTest.cpp
Listing 18: VectorTest.cpp
D.2 MapTest.cpp
0 of .
Results for:
No results containing your search query
P. 1
Implementing Container Classes in Shared Memory

Implementing Container Classes in Shared Memory

Ratings: (0)|Views: 100 |Likes:
Published by fbergeon

More info:

Published by: fbergeon on Jul 16, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

05/03/2013

pdf

text

original

You're Reading a Free Preview
Pages 4 to 57 are not shown in this preview.
You're Reading a Free Preview
Pages 61 to 76 are not shown in this preview.
You're Reading a Free Preview
Pages 80 to 122 are not shown in this preview.
You're Reading a Free Preview
Pages 126 to 136 are not shown in this preview.

Activity (3)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
Lars Wirfelt liked this

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->