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

Table Of Contents

Introduction
1.1 Thesis statement
1.2 Goals and evaluation criteria
1.3 Conventions
Summary and main results
2.1 Summary
2.2 Topics not covered in this dissertation
2.3 Organisation of the dissertation
2.4 Main results and contributions
Previous work
3.1 Object-oriented concurrency models
3.2 Multithreading
3.3. CONCURRENCY IN EIFFEL 35
3.3 Concurrency in Eiffel
Original SCOOP 97 model
4.1 Development
4.2 SCOOP 97 in detail
4.2.1 Processors and separate objects
4.2.2 Separate entities, classes, and calls
4.2.3 Synchronisation
4.2.4 Consistency rules
4.2.5 Additional rules and mechanisms
4.2.6 Proof rule for feature calls
4.2.7 Advanced features
4.3 Related work
Beyond SCOOP 97: critique and roadmap
5.1 Semantics of separate annotations
5.2 Separate call rule
5.3 Feature call vs. feature application
5.4 Consistency rules
5.5. REASONING ABOUT OBJECT LOCALITY 67
5.5 Reasoning about object locality
5.6 Semantics of contracts
5.7 Proof rules
5.8 Locking policy
5.8.1 Eager locking
5.8.2 Cross-client locking and separate callbacks
5.8.3 Void separate arguments
5.9 Quasi-asynchrony
5.10. POLYMORPHISM AND DYNAMIC BINDING 75
5.10 Polymorphism and dynamic binding
5.11 Genericity
5.12 Practical considerations
5.12.1 Enclosing routines
5.12.2 Deferred classes
5.12.3 Software reuse
5.13 Discussion
Type system for SCOOP
6.1 Computational model
6.1.1 Feature call
6.1.2 Feature application
6.1.3 Synchronisation
6.2 From consistency rules to a type system
6.2.1 SCOOP types
6.2.2 Processor tags
6.2.3 Implicit types
6.3 Subtyping
6.4 Type combinators
6.5 Valid targets
6.6 Object creation
6.7 Handling false traitors
6.8 Object import
6.9 Object equality
6.10 Expanded types
6.11. FORMALISATION OF THE TYPE SYSTEM 111
6.11 Formalisation of the type system
6.11.1 SCOOPC programs
6.11.2 Typing environments
6.11.3 Valid types
6.11.4 Subtyping
6.11.5 Well-formed environments
6.12.1 Example
6.12.2 Lemmas
Flexible locking
7.1 Eliminating unnecessary locks
7.1.1 (Too much) locking considered harmful
7.1.2 Semantics of attached types
7.1.3 Support for inheritance and polymorphism
7.2 Lock passing
7.2.1 Need for lock passing
7.2.2 Mechanism
7.2.3 Lock passing in practice
7.3 Related work
Contracts and concurrency
8.1 Generalised semantics of contracts
8.1.1 Preconditions
8.1.2 Postconditions
8.1.3 Invariants
8.1.4 Loop assertions and check instructions
8.2 Towards a proof rule
8.3 Discussion
8.3.1 Contract redefinition
8.3.2 Importance of lock passing
8.3.3 Run-time assertion checking
8.4 Related work
Advanced object-oriented mechanisms in SCOOP
9.1 Inheritance and polymorphism
9.1.1 Multiple inheritance
9.1.2 Polymorphism and dynamic binding
9.2.3 Actual result types
9.2.4 Actual argument types
9.2.5 Detachable generic parameters
9.2.6 Type conformance
9.2.7 Discussion
9.3 Agents
9.3.1 Agents as potential traitors
9.3.2 Separate agents
9.3.3 Open targets
9.3.4 Applications of separate agents
9.4 Once routines
9.5 Discussion
Using SCOOP in practice
10.1 Classic examples
10.1.1 Dining philosophers: atomic locking of multiple resources
10.1.2 Producers-consumers: condition sychronisation
10.1.3 Binary search trees: efficient parallelisation
10.1.4 Santa Claus: barriers and priority scheduling
10.2 Agents and asynchrony
10.2.1 Rendezvous synchronisation and active objects
10.2.2 Waiting faster
10.2.3 Resource pooling
10.3.2 Arm robot
10.4 Code reuse
10.5 Inheritance anomalies
10.6 Discussion
Implementation: issues and solutions
11.1 Supported mechanisms
11.2 SCOOPLI library
11.2.1 Processors
11.2.2 Separate objects
11.2.3 Separate calls
11.2.4 Scheduling, locking, and wait conditions
11.2.5 Lock passing
11.2.6 Quiescence and termination
11.2.7 Garbage collection
11.3 Scoop2scoopli tool
11.3.1 Code generation
11.3.2 Bootstrapping
11.3.3 Invariant checking
11.3.4 Postcondition checking
11.4 CONCURRENCY library
11.4.1 CONCURRENCY
11.4.2 EXECUTOR
11.4.3 ANSWER COLLECTOR
11.4.4 EVALUATOR
11.4.5 POOL MANAGER
11.4.6 LOCKER
11.4.7 SCOOP-enabledEVENT TYPE
12.1 Topics
12.2 Assessment
12.3 Students’ feedback
12.4 Discussion
13.1 Applicability to other languages
13.2. LIMITATIONS AND FUTURE WORK 299
13.2 Limitations and future work
13.3 Final remarks
CONCURRENCY library
List of Figures
0 of .
Results for:
No results containing your search query
P. 1
Thesis (2)

Thesis (2)

Ratings: (0)|Views: 16|Likes:
Published by narendra

More info:

Published by: narendra on Oct 23, 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

10/23/2011

pdf

text

original

You're Reading a Free Preview
Pages 8 to 132 are not shown in this preview.
You're Reading a Free Preview
Pages 140 to 146 are not shown in this preview.
You're Reading a Free Preview
Pages 154 to 202 are not shown in this preview.
You're Reading a Free Preview
Pages 210 to 257 are not shown in this preview.
You're Reading a Free Preview
Pages 265 to 353 are not shown in this preview.

You're Reading a Free Preview

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