Results 231 to 240 of about 30,211 (267)
Some of the next articles are maybe not open access.
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
1991
This is a draft version of a chapter for the Handbook of Logic and the Foundations of Computer Science, Oxford University Press. The final draft can be found as DAIMI PB 463. It surveys a range of models for parallel computation to include interleaving models like transition systems, synchronisation trees and languages (often called Hoare traces in
openaire +1 more source
This is a draft version of a chapter for the Handbook of Logic and the Foundations of Computer Science, Oxford University Press. The final draft can be found as DAIMI PB 463. It surveys a range of models for parallel computation to include interleaving models like transition systems, synchronisation trees and languages (often called Hoare traces in
openaire +1 more source
IEEE Internet Computing, 2007
Programmers writing multithreaded applications in languages like Java and C++ spend much of their time determining what state is shared among threads and how best to protect its integrity within the running application. Finding all the shared state isn't always easy.
openaire +1 more source
Programmers writing multithreaded applications in languages like Java and C++ spend much of their time determining what state is shared among threads and how best to protect its integrity within the running application. Finding all the shared state isn't always easy.
openaire +1 more source
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 +1 more source
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 +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 +1 more source
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 +1 more source
Concurrence Measurement for the Two-Qubit Optical and Atomic States
Entropy, 2015Yu-Bo Sheng, Sheng Yu-Bo
exaly
Lower bound on concurrence for arbitrary-dimensional tripartite quantum states
Quantum Information Processing, 2016Shao-Ming Fei, Fei Shao-Ming
exaly