Sciweavers

7891 search results - page 218 / 1579
» A Distributed Scheduling Framework
Sort
View
101
Voted
CGO
2003
IEEE
15 years 9 months ago
Improving Quasi-Dynamic Schedules through Region Slip
Modern processors perform dynamic scheduling to achieve better utilization of execution resources. A schedule created at run-time is often better than one created at compile-time ...
Francesco Spadini, Brian Fahs, Sanjay J. Patel, St...
ISCC
2002
IEEE
131views Communications» more  ISCC 2002»
15 years 8 months ago
Scheduling real time parallel structure on cluster computing
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
Reda A. Ammar, Abdulrahman Alhamdan
MOBIHOC
2010
ACM
15 years 1 months ago
Longest-queue-first scheduling under SINR interference model
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...
Long Bao Le, Eytan Modiano, Changhee Joo, Ness B. ...
ISPAN
2005
IEEE
15 years 9 months ago
Process Scheduling for the Parallel Desktop
Commodity hardware and software are growing increasingly more complex, with advances such as chip heterogeneity and specialization, deeper memory hierarchies, ne-grained power ma...
Eitan Frachtenberg
ICDCN
2010
Springer
15 years 10 months ago
Scheduling in Multi-Channel Wireless Networks
Abstract. The availability of multiple orthogonal channels in a wireless network can lead to substantial performance improvement by alleviating contention and interference. However...
Vartika Bhandari, Nitin H. Vaidya