10106 search results - page 321 / 2022 » Algorithm Selection and Scheduling |
172
click to vote
TPDS
1998
15 years 6 months ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
183
click to vote
IPPS
2005
IEEE
16 years 8 days ago
2005
IEEE
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
158
click to vote
AINA
2006
IEEE
16 years 23 days ago
2006
IEEE
In this paper we study the problem of scheduling messages between two parallel machines connected by a low latency network during a data redistribution. We compare two approaches....
175
click to vote
ECRTS
2000
IEEE
15 years 11 months ago
2000
IEEE
The imprecise computation(IC) model is a general scheduling framework, capable of expressing the precision vs. timeliness trade-off involved in many current real-time applications...
230
click to vote
ADBIS
1997
Springer
15 years 11 months ago
1997
Springer
Simulating distributed database systems is inherently difficult, as there are many factors that may influence the results. This includesarchitectural options as well as workload...