Sciweavers

443 search results - page 15 / 89
» Relations in Concurrency
Sort
View
TACAS
1998
Springer
115views Algorithms» more  TACAS 1998»
14 years 1 months ago
MESA: Support for Scenario-Based Design of Concurrent Systems
The latest ITU-T standard syntax of Message Sequence Charts (MSCs) 16] o ers several operators to compose MSCs in a hierarchical, iterating, and nondeterministic way. However, curr...
Hanêne Ben-Abdallah, Stefan Leue
RTAS
1999
IEEE
14 years 1 months ago
MIRROR: A State-Conscious Concurrency Control Protocol for Replicated Real-Time Databases
Data replication can help database systems meet the stringent temporal constraints of current time-critical applications, especially Internet-based services. A prerequisite, howev...
Ming Xiong, Krithi Ramamritham, Jayant R. Haritsa,...
IPPS
2006
IEEE
14 years 2 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
SPIN
2010
Springer
13 years 7 months ago
Context-Bounded Translations for Concurrent Software: An Empirical Evaluation
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
Naghmeh Ghafari, Alan J. Hu, Zvonimir Rakamaric
HOTOS
2003
IEEE
14 years 2 months ago
Why Events Are a Bad Idea (for High-Concurrency Servers)
Event-based programming has been highly touted in recent years as the best way to write highly concurrent applications. Having worked on several of these systems, we now believe t...
J. Robert von Behren, Jeremy Condit, Eric A. Brewe...