1257 search results - page 62 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
135
click to vote
ICDCS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a design and analysis of scheduling techniques to cope with the inherent unreliability and instability of worker nodes in large-scale donation-based distribute...
150
click to vote
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—In this paper, we introduce a framework for distributed opportunistic scheduling in multihop wireless ad hoc networks. With the proposed framework, one can take a schedu...
130
click to vote
IOR
2010
15 years 2 months ago
2010
In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after...
152
Voted
SIGMETRICS
1998
ACM
15 years 3 months ago
1998
ACM
Implicitcoscheduling is a distributed algorithm fortime-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local sche...
125
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Computational grids clusters, provide powerful computing resources for executing applications of large scale. In Grid (clusters) usually several applications run simultaneously.Th...