Sciweavers

570 search results - page 50 / 114
» concurrency 2006
Sort
View
PAAPP
2006
71views more  PAAPP 2006»
15 years 5 months ago
An efficient parallel termination detection algorithm
Abstract: In this paper, we present a new, easy to implement algorithm for detecting the termination of a parallel asynchronous computation on distributedmemory MIMD computers. We ...
Allison H. Baker, Silvia A. Crivelli, Elizabeth R....
FUIN
2002
94views more  FUIN 2002»
15 years 5 months ago
A Class of Composable and Preemptible High-level Petri Nets with an Application to Multi-Tasking Systems
This paper presents an extension of an algebra of high-level Petri nets with operations for suspension and abortion. These operations are sound with respect to the semantics of pre...
Hanna Klaudel, Franck Pommereau
PPL
2007
88views more  PPL 2007»
15 years 5 months ago
Terminating alternator
In this paper, we present an program that enables the transformation of a nonterminating alternator into a terminating alternator. Our solution is stabilization preserving and has...
Sandeep S. Kulkarni
IPL
2010
95views more  IPL 2010»
15 years 4 months ago
Resource bisimilarity and graded bisimilarity coincide
Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of c...
Luca Aceto, Anna Ingólfsdóttir, Josh...
JUCS
2010
129views more  JUCS 2010»
15 years 4 months ago
An Extensible Interpreter Framework for Software Transactional Memory
: Software transactional memory (STM) is a new approach for coordinating concurrent threads, for which many different implementation strategies are currently being researched. In ...
Charlotte Herzeel, Pascal Costanza, Theo D'Hondt