Sciweavers

5149 search results - page 536 / 1030
» Timed Asynchronous Distributed Systems
Sort
View
IPPS
2007
IEEE
16 years 22 days ago
Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
Hakem Beitollahi, Seyed Ghassem Miremadi, Geert De...
CCGRID
2006
IEEE
16 years 15 days ago
Integrating Gridcomputing and Metamodeling
Simulation and optimization of complex mechanical and electronical systems is a very time consuming and computationally intensive task. Therefore, metamodeling techniques are ofte...
Dirk Gorissen, Wouter Hendrickx, Karel Crombecq, T...
SIAMDM
2002
94views more  SIAMDM 2002»
15 years 6 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
GCC
2006
Springer
15 years 10 months ago
Decentralized Workflow Execution for Virtual Enterprises in Grid Environment
With the emergence of global market and virtual enterprises, coordination of business processes in dispersed organizations by distributed workflow execution will take on more impo...
Wei Tan, Yushun Fan
DC
2010
15 years 6 months ago
Refined quorum systems
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
Rachid Guerraoui, Marko Vukolic