3844 search results - page 403 / 769 » Distributed Meeting Scheduling |
191
click to vote
RTAS
2010
IEEE
15 years 5 months ago
2010
IEEE
Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore...
197
click to vote
TC
2010
15 years 1 months ago
2010
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...
169
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
177
Voted
SC
2009
ACM
16 years 1 months ago
2009
ACM
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a tas...
174
click to vote
CCGRID
2008
IEEE
16 years 1 months ago
2008
IEEE
Understanding the potential and implications of asymmetric multi-core processors for cluster computing is necessary, as these processors are rapidly becoming mainstream components...