Sciweavers

5448 search results - page 397 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
TOMACS
2011
139views more  TOMACS 2011»
15 years 1 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
HPDC
2011
IEEE
14 years 10 months ago
Algorithm-based recovery for iterative methods without checkpointing
In today’s high performance computing practice, fail-stop failures are often tolerated by checkpointing. While checkpointing is a very general technique and can often be applied...
Zizhong Chen
QUESTA
2002
38views more  QUESTA 2002»
15 years 6 months ago
Two-Class Priority Queueing System with State-Dependent Arrivals
In this paper, we present a performance analysis of a 2-dimensional preemptive priority queueing system with state-dependent arrivals. Using a Markovian formulation we first comput...
Gabriel R. Bitran, René Caldentey
JSSPP
2009
Springer
16 years 1 months ago
Competitive Two-Level Adaptive Scheduling Using Resource Augmentation
Abstract. As multi-core processors proliferate, it has become more important than ever to ensure efficient execution of parallel jobs on multiprocessor systems. In this paper, we s...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
ICDCS
2008
IEEE
16 years 1 months ago
Fair K Mutual Exclusion Algorithm for Peer to Peer Systems
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
Vijay Anand Reddy, Prateek Mittal, Indranil Gupta