Sciweavers

4604 search results - page 101 / 921
» Concurrency in Synchronous Systems
Sort
View
ASPLOS
2012
ACM
13 years 5 months ago
Scalable address spaces using RCU balanced trees
Software developers commonly exploit multicore processors by building multithreaded software in which all threads of an application share a single address space. This shared addre...
Austin T. Clements, M. Frans Kaashoek, Nickolai Ze...
TACAS
2010
Springer
142views Algorithms» more  TACAS 2010»
15 years 4 months ago
Tracking Heaps That Hop with Heap-Hop
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
Jules Villard, Étienne Lozes, Cristiano Cal...
JSA
2006
114views more  JSA 2006»
14 years 9 months ago
Distributed computing using Java: A comparison of two server designs
This paper proposes a new concurrent data structure, called parallel hash table, for synchronizing the access of multiple threads to resources stored in a shared buffer. We prove ...
Boris Roussev, Jie Wu
CODES
2002
IEEE
15 years 2 months ago
The design context of concurrent computation systems
Design for performance-optimization of programmable, semicustom SoCs requires the ability to model and optimize the behavior of the system as a whole. Neither the hardware-testben...
JoAnn M. Paul, Christopher M. Eatedali, Donald E. ...
POPL
2012
ACM
13 years 5 months ago
Resource-sensitive synchronization inference by abduction
We present an analysis which takes as its input a sequential program, augmented with annotations indicating potential parallelization opportunities, and a sequential proof, writte...
Matko Botincan, Mike Dodds, Suresh Jagannathan