Results 271 to 280 of about 36,627 (309)
Some of the next articles are maybe not open access.
Proceedings of ICCI'93: 5th International Conference on Computing and Information, 2002
The paper presents a proposal for introducing concurrency to a sequential object-oriented programming language, C++. We call the extended language CC++. It distinguishes two categories of objects: process objects and class objects. Process objects are coarse-grain concurrent entities.
Xining Li, He Huang
openaire +2 more sources
The paper presents a proposal for introducing concurrency to a sequential object-oriented programming language, C++. We call the extended language CC++. It distinguishes two categories of objects: process objects and class objects. Process objects are coarse-grain concurrent entities.
Xining Li, He Huang
openaire +2 more sources
Concurrent garbage collection for concurrent rewriting
1995We describe an algorithm that achieves garbage collection when performing concurrent rewriting. We show how this algorithm follows the implementation model of concurrent graph rewriting. This model has been studied and directly implemented on MIMD machines where nodes of the graph are distributed over a set of processors.
openaire +2 more sources
International Journal on Software Tools for Technology Transfer, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Proceedings of the 2006 ACM SIGPLAN workshop on Erlang, 2006
A concurrent cache design is presented which allows cached data to be spread across a cluster of computers. The implementation separates persistent storage from cache storage and abstracts the cache behaviour so that the user can experiment with cache size and replacement policy to optimize performance for a given system, even if the production data ...
openaire +1 more source
A concurrent cache design is presented which allows cached data to be spread across a cluster of computers. The implementation separates persistent storage from cache storage and abstracts the cache behaviour so that the user can experiment with cache size and replacement policy to optimize performance for a given system, even if the production data ...
openaire +1 more source
1992
This textbook is designed as a first book on concurrent programming for computer science undergraduates, and provides a comprehensive introduction to the problems of concurrency. Concurrency is of vital importance in many areas of computer science, particularly in operating systems. It is also increasingly being taught in undergraduate courses.
openaire +1 more source
This textbook is designed as a first book on concurrent programming for computer science undergraduates, and provides a comprehensive introduction to the problems of concurrency. Concurrency is of vital importance in many areas of computer science, particularly in operating systems. It is also increasingly being taught in undergraduate courses.
openaire +1 more source
2007
A category of event structures with symmetry is introduced and its categorical properties investigated. Applications to the eventstructure semantics of higher order processes, nondeterministic dataflow and the unfolding of higher-dimensional automata and Petri nets with multiple tokens are indicated.
openaire +2 more sources
A category of event structures with symmetry is introduced and its categorical properties investigated. Applications to the eventstructure semantics of higher order processes, nondeterministic dataflow and the unfolding of higher-dimensional automata and Petri nets with multiple tokens are indicated.
openaire +2 more sources
ACM SIGCSE Bulletin, 1992
Concurrency is introduced in most operating systems textbooks, but usually, only the basics of synchronization and mutual exclusion are presented. The more complicated examples are invariably canned code such as the producer/consumer or readers/writers problems.
openaire +2 more sources
Concurrency is introduced in most operating systems textbooks, but usually, only the basics of synchronization and mutual exclusion are presented. The more complicated examples are invariably canned code such as the producer/consumer or readers/writers problems.
openaire +2 more sources
1990
This paper surveys some computability aspects in structural operational specifications, fairness concepts and testing equivalences, with special emphasis on infinite behaviours.
openaire +2 more sources
This paper surveys some computability aspects in structural operational specifications, fairness concepts and testing equivalences, with special emphasis on infinite behaviours.
openaire +2 more sources
On optimistic methods for concurrency control
ACM Transactions on Database Systems, 1981H T Kung, David K Hsiao
exaly