Sciweavers

2303 search results - page 192 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
154
Voted
CONCUR
1999
Springer
15 years 8 months ago
On the Semantics of Place/Transition Nets
We present several interpretations of the behavior of P/T nets in terms of traces, event structures, and partial orders. Starting from results of Hoogers, Kleijn and Thiagarajan, w...
Rémi Morin, Brigitte Rozoy
124
Voted
IPPS
1998
IEEE
15 years 8 months ago
A Generalized Forward Recovery Checkpointing Scheme
We propose a generalized forward recovery checkpointing scheme, with lookahead execution and rollback validation. This method takes advantage of voting and comparison on multiple v...
Ke Huang, Jie Wu, Eduardo B. Fernández
195
Voted
IPPS
1997
IEEE
15 years 8 months ago
Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
Alan A. Bertossi, Andrea Fusiello, Luigi V. Mancin...
115
Voted
CCGRID
2004
IEEE
15 years 7 months ago
When can an autonomous reputation scheme discourage free-riding in a peer-to-peer system?
We investigate the circumstances under which it is possible to discourage free-riding in a peer-to-peer system for resource-sharing by prioritizing resource allocation to peers wi...
Nazareno Andrade, Miranda Mowbray, Walfredo Cirne,...
101
Voted
CONCUR
2010
Springer
15 years 4 months ago
A Geometric Approach to the Problem of Unique Decomposition of Processes
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
Thibaut Balabonski, Emmanuel Haucourt