Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,206,574 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Bin packing problem
Computer science
Fernandez’s method
Job shop scheduling
Expand
Broader (3)
Combinatorial optimization
Mathematical optimization
Scheduling (computing)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Multiprocessor Synchronization and Hierarchical Scheduling
Farhang Nemati
,
M. Behnam
,
Thomas Nolte
International Conference on Parallel Processing…
2009
Corpus ID: 12764823
Multi-core architectures have received significant interest as thermal and power consumption problems limit further increase of…
Expand
2008
2008
Nonmigratory Multiprocessor Scheduling for Response Time and Energy
T. Lam
,
Lap-Kei Lee
,
I. K. To
,
Prudence W. H. Wong
IEEE Transactions on Parallel and Distributed…
2008
Corpus ID: 14161945
Energy usage has been an important concern in recent research on online job scheduling, where processors are allowed to vary the…
Expand
2007
2007
The partitioned dynamic-priority scheduling of sporadic task systems
Sanjoy Baruah
,
N. Fisher
Real-time systems
2007
Corpus ID: 7995237
Abstract A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an…
Expand
2006
2006
Global static-priority scheduling of sporadic task systems on multiprocessor platforms
N. Fisher
,
Sanjoy Baruah
2006
Corpus ID: 9377386
The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient conditions are derived for determining…
Expand
2004
2004
Schedulable Utilization Bounds for EPDF Fair Multiprocessor Scheduling ?
Umamaheswari Devi
,
James H. Anderson
2004
Corpus ID: 15097112
The earliest-pseudo-deadline-first (EPDF) algorithm is less expensive than other known Pfair algorithms, but is not optimal for…
Expand
2003
2003
The directional p-median problem with applications to traffic quantization and multiprocessor scheduling
L. E. Jackson
,
G. Rouskas
,
Matthias F. Stallmann
2003
Corpus ID: 118835229
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the…
Expand
1997
1997
A Relation between Multiprocessor Scheduling and Linear Programming
A. Moukrim
,
A. Quilliot
1997
Corpus ID: 117397580
The general non preemptive multiprocessor scheduling problem (NPMS) is NP-Complete, while in many specific cases, the same…
Expand
1993
1993
The Spring scheduling co-processor: Design, use, and performance
D. Niehaus
,
K. Ramamritham
,
+4 authors
Jason Ko
Proceedings Real-Time Systems Symposium
1993
Corpus ID: 37007002
We present a novel VLSI co-processor for real-time multiprocessor scheduling. The co-processor can be used for sophisticated…
Expand
1988
1988
Cyclo-Static Realizations, Loop Unrolling and CPM: Optimal Multiprocessor Scheduling
D. Schwartz
1988
Corpus ID: 56505578
Optimal, deterministic scheduling, for a class of iterative/recursive problems is explored. The connection between the program…
Expand
Review
1980
Review
1980
An introduction to multiprocessor scheduling
J. K. Lenstra
,
A. H. G. Rinnooy Kan
1980
Corpus ID: 60802701
This is a tutorial survey of recent results in the area of multiprocessor scheduling. Computational complexity theory provides…
Expand