Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Multiprocessor scheduling

In computer science, multiprocessor scheduling is an NP-hard optimization problem. The problem statement is: "Given a set J of jobs where job ji has… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
We consider the problem of optimal real-time scheduling of periodic and sporadic tasks for identical multiprocessors. A number of… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Recently, there have been several promising techniques developed for schedulability analysis and response time analysis for… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Chip-multiprocessors represent a dominant new shift in the field of processor design. Better utilization of such technology in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Real-time multiprocessor systems are now commonplace. Designs range from single-chip architectures, with a modest number of… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We have developed a genetic algorithm (GA) approach to the problem of task scheduling for multiprocessor systems. Our approach… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The preemptive scheduling of systems of periodic tasks on a platform comprised of several identical processors is considered. A… Expand
  • figure 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected at a certain penalty. An… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The problem of multiprocessor scheduling can be stated as finding a schedule for a general task graph to be executed on a… Expand
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure I
Is this relevant?
Highly Cited
1978
Highly Cited
1978
We consider one of the basic, well-studied problems of scheduling theory, that of nonpreemptively scheduling n independent tasks… Expand
Is this relevant?
Highly Cited
1975
Highly Cited
1975
We examine the computational complexity of scheduling problems associated with a certain abstract model of a multiprocessing… Expand
Is this relevant?