967 search results - page 16 / 194 » Multi-users scheduling in parallel systems |
123
click to vote
IPPS
2000
IEEE
15 years 8 months 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...
159
click to vote
ICPP
1998
IEEE
15 years 8 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...
134
click to vote
IPPS
2008
IEEE
15 years 10 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...
255
click to vote
CISIS
2010
IEEE
14 years 8 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...
148
click to vote
ISORC
2008
IEEE
15 years 10 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...