967 search results - page 16 / 194 » Multi-users scheduling in parallel systems |
IPPS
2000
IEEE
14 years 2 days ago
2000
IEEE
Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems. The methodology has two primary features: communica...
ICPP
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-ca...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper addresses nonclairvoyant and nonpreemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processor...
CISIS
2010
IEEE
12 years 11 months ago
2010
IEEE
Work-stealing is the todays algorithm of choice for dynamic load-balancing of irregular parallel applications on multiprocessor systems. We have evaluated the algorithm’s effic...
ISORC
2008
IEEE
14 years 2 months ago
2008
IEEE
Some emerging networked embedded real-time applications have relatively long reaction time magnitudes—e.g., milliseconds to minutes. These longer execution time magnitudes allow...