1257 search results - page 163 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
ICDT
2005
ACM
15 years 3 months ago
2005
ACM
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
118
click to vote
ICDCS
2000
IEEE
15 years 2 months ago
2000
IEEE
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
ICPP
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we deal with the problem of scheduling streaming applications on unreliable heterogeneous platforms. We use the realistic one-port model with full computation/commu...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...