Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,401,822 papers from all fields of science
Search
Sign In
Create Free Account
List scheduling
The basic idea of list scheduling is to make an ordered list of processes by assigning them some priorities, and then repeatedly execute the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Critical path method
Heterogeneous Earliest Finish Time
Instruction scheduling
List of algorithms
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A hierarchical approach for energy-efficient scheduling of large workloads in multicore distributed systems
B. Dorronsoro
,
Sergio Nesmachnow
,
J. Taheri
,
Albert Y. Zomaya
,
El-Ghazali Talbi
,
P. Bouvry
Sustainable Computing: Informatics and Systems
2014
Corpus ID: 17075034
2010
2010
Enhancing list scheduling heuristics for dependent job scheduling in grid computing environments
Geoffrey Falzon
,
Maozhen Li
Journal of Supercomputing
2010
Corpus ID: 16266213
Job scheduling plays a critical role in resource utilisation in a grid computing environment. The heterogeneity of grid resources…
Expand
2008
2008
Task Scheduling and Lightpath Establishment in Optical Grids
Xin Liu
,
Wei Wei
,
+4 authors
Minyou Wu
IEEE INFOCOM - The 27th Conference on Computer…
2008
Corpus ID: 4366789
Data-intensive Grid applications require huge data transferring between multiple geographically separated computing nodes where…
Expand
2006
2006
Scheduling unit length jobs with parallel nested machine processing set restrictions
C. Glass
,
H. Mills
Computers & Operations Research
2006
Corpus ID: 29636373
2005
2005
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion
J. Błażewicz
,
E. Pesch
,
Małgorzata Sterna
,
Frank Werner
Computers & industrial engineering
2005
Corpus ID: 9227937
2004
2004
Flow Shop Scheduling with Late Work Criterion - Choosing the Best Solution Strategy
J. Błażewicz
,
E. Pesch
,
Małgorzata Sterna
,
Frank Werner
Asian Applied Computing Conference
2004
Corpus ID: 206719474
In the paper, we analyze different solution methods for the two-machine flow shop scheduling problem with a common due date with…
Expand
2000
2000
Optimizing Overall Loop Schedules Using Prefetching and Partitioning
Fei Chen
,
T. O'Neil
,
E. Sha
IEEE Trans. Parallel Distributed Syst.
2000
Corpus ID: 14395143
In this paper, a method combining the loop pipelining technique with data prefetching, called Partition Scheduling with…
Expand
Highly Cited
1999
Highly Cited
1999
Instruction Scheduling for TriMedia
J. Hoogerbrugge
,
L. Augusteijn
J. Instr. Level Parallelism
1999
Corpus ID: 12207169
Instruction scheduling is a crucial phase in a compiler for very long instruction word (VLIW) processors. This paper describes…
Expand
1997
1997
Decisive path scheduling: a new list scheduling method
G. Park
,
B. Shirazi
,
J. Marquis
,
Hyunseung Choo
Proceedings of the International Conference on…
1997
Corpus ID: 29733306
Scheduling parallel tasks represented as a Directed Acyclic Graph (DAG), on a multiprocessor system has been an important…
Expand
1988
1988
Optimization of horizontal microcode generation for loop structures
C. Eisenbeis
International Conference on Supercomputing
1988
Corpus ID: 7608826
MIMOSA is an experimental software for the automatic generation and optimization of microcode for horizontal microprogrammed…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE