Sciweavers

346 search results - page 58 / 70
» Determinizing Asynchronous Automata
Sort
View
SOFSEM
2010
Springer
15 years 6 months ago
Parallel Randomized Load Balancing: A Lower Bound for a More General Model
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
Guy Even, Moti Medina
ISORC
2009
IEEE
15 years 4 months ago
On the Semantics of UML/MARTE Clock Constraints
The UML goal of being a general-purpose modeling language discards the possibility to adopt too precise and strict a semantics. Users are to refine or define the semantics in th...
Frédéric Mallet, Charles André...
FOSSACS
2010
Springer
15 years 4 months ago
Reachability Analysis of Communicating Pushdown Systems
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
Alexander Heußner, Jérôme Lerou...
IPPS
2008
IEEE
15 years 4 months ago
A deterministic multi-way rendezvous library for haskell
The advent of multicore processors requires mainstream concurrent programming languages with high level concurrency constructs and effective debugging techniques. Unfortunately, m...
Nalini Vasudevan, Satnam Singh, Stephen A. Edwards
IPPS
2005
IEEE
15 years 3 months ago
Practical Performance Model for Optimizing Dynamic Load Balancing of Adaptive Applications
Optimizing the performance of dynamic load balancing toolkits and applications requires the adjustment of several runtime parameters; however, determining sufficiently good value...
Kevin Barker, Nikos Chrisochoides