Sciweavers

1095 search results - page 7 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
ICPADS
2006
IEEE
15 years 3 months ago
Efficient Compile-Time Task scheduling for Heterogeneous Distributed Computing Systems
Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (or HeDCSs). Because of its key importance, several scheduling...
Mohammad I. Daoud, Nawwaf N. Kharma
INFOCOM
2009
IEEE
15 years 4 months ago
Minimizing Average Finish Time in P2P Networks
—Peer-to-peer (P2P) file distribution is a scalable way to disseminate content to a wide audience. For a P2P network, one fundamental performance metric is the average time need...
G. Matthew Ezovski, Ao Tang, Lachlan L. H. Andrew
ICDCS
1996
IEEE
15 years 1 months ago
Dynamic Scheduling Strategies for Shared-memory Multiprocessors
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
Babak Hamidzadeh, David J. Lilja
CSREAESA
2006
14 years 11 months ago
Generalized Deterministic Task Scheduling Algorithm for Embedded Real-Time Operating Systems
- In recent years, there has been a rapid and wide spread proliferation of non-traditional embedded computing platforms such as digital camcorders, cellular phones, and portable me...
Myoung-Jo Jung, Moon-Haeng Cho, Yong-Hee Kim, Cheo...
TPDS
1998
125views more  TPDS 1998»
14 years 9 months ago
An Efficient Dynamic Scheduling Algorithm For Multiprocessor Real-Time Systems
—Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for no...
G. Manimaran, C. Siva Ram Murthy