1257 search results - page 112 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
101
click to vote
ICPPW
2006
IEEE
15 years 7 months ago
2006
IEEE
In this paper, we present a runtime method for scheduling parallel applications on dynamic and heterogeneous platforms. It can be used to schedule parallel applications whose tota...
122
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
SPAA
2006
ACM
15 years 7 months ago
2006
ACM
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
137
click to vote
IPPS
2008
IEEE
15 years 8 months ago
2008
IEEE
Many scientific applications need to stage large volumes of files from one set of machines to another set of machines in a wide-area network. Efficient execution of such data t...
120
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...