511 search results - page 30 / 103 » Analysis of Multi-Organization Scheduling Algorithms |
100
click to vote
JSAC
2007
14 years 11 months ago
2007
— Despite its low-complexity, the zero-forcing receiver is known to suffer from noise enhancement to restore the spatially multiplexed data in a single-user MIMO system. Neverthe...
103
click to vote
ECRTS
2004
IEEE
15 years 3 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
In this paper we consider multiprocessor scheduling with hard deadlines and investigate the cost of eliminating migration in the online setting. Let I be any set of jobs that can ...
115
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
131
click to vote
IFIPTCS
2010
14 years 9 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...