1257 search results - page 127 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
103
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...
84
Voted
SPAA
1990
ACM
15 years 5 months ago
1990
ACM
d Abstract) Richard J. Anderson Paul Beame Walter L. Ruzzo Department of Computer Science and Engineering University of Washingtoni We introduce a task scheduling model which is u...
137
click to vote
GRID
2008
Springer
15 years 2 months ago
2008
Springer
Grid data streaming applications are novel from others in that they require real-time data supply while the processing is going on, which necessitates harmonious collaborations am...
143
click to vote
RTAS
2007
IEEE
15 years 8 months ago
2007
IEEE
Cluster computing has emerged as a new paradigm for solving large-scale problems. To enhance QoS and provide performance guarantees in cluster computing environments, various real...
HPCC
2005
Springer
15 years 7 months ago
2005
Springer
This study concerns a threshold-based matching algorithm for Clos (t-MAC) network switches. The studied Clos network uses a central photonic switch fabric for transporting high-spe...