Sciweavers

EUROPAR
2010
Springer
14 years 1 days ago
Hierarchical Work-Stealing
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...
Jean-Noël Quintin, Frédéric Wag...
EUROPAR
2010
Springer
14 years 1 days ago
Non-clairvoyant Scheduling of Multiple Bag-of-Tasks Applications
The bag-of-tasks application model, albeit simple, arises in many application domains and has received a lot of attention in the scheduling literature. Previous works propose eithe...
Henri Casanova, Matthieu Gallet, Fréd&eacut...
EUROPAR
2010
Springer
14 years 1 days ago
Profile-Driven Selective Program Loading
Abstract. Complex software systems use many shared libraries frequently composed of large off-the-shelf components. Only a limited number of functions are used from these shared li...
Tugrul Ince, Jeffrey K. Hollingsworth
EUROPAR
2010
Springer
14 years 1 days ago
A Model for Space-Correlated Failures in Large-Scale Distributed Systems
Matthieu Gallet, Nezih Yigitbasi, Bahman Javadi, D...
CONCUR
2010
Springer
14 years 2 days ago
Modal Logic over Higher Dimensional Automata
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...
Cristian Prisacariu
CONCUR
2010
Springer
14 years 2 days ago
A Logic for True Concurrency
We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. The induced logical equivalence is hereditary history p...
Paolo Baldan, Silvia Crafa
CONCUR
2010
Springer
14 years 2 days ago
A Theory of Design-by-Contract for Distributed Multiparty Interactions
Reliability is a critical issue in many multi-organizational distributed applications, be they web services, financial protocols, scientific computing infrastructure, and software ...
Laura Bocchi, Kohei Honda, Emilio Tuosto, Nobuko Y...
CONCUR
2010
Springer
14 years 2 days ago
Termination in Impure Concurrent Languages
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
CONCUR
2010
Springer
14 years 2 days ago
Bisimilarity of One-Counter Processes Is PSPACE-Complete
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (wit...
Stanislav Böhm, Stefan Göller, Petr Janc...