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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1970-2017
0204019702017

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… (More)
  • 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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the goal of meeting deadlines… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical… (More)
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… (More)
  • 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… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Many algorithms for scheduling DAGs on multiprocessors have been proposed, but there has been little work done to determine their… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Scheduling policies for general purpose multiprogrammed multiprocessors are not well understood. This paper examines various… (More)
  • table 4.1
  • table 4.2
  • figure 4.1
  • figure 4.3
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Processing Time first algorithm always finds a schedule having makespan within 43 1. Key words, bin packing, multiprocessor… (More)
Is this relevant?
Highly Cited
1977
Highly Cited
1977
In a distributed computing system a modular program must have its modules assigned among the processors so as to avoid excessive… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?