Scheduling Sequential Loops on Parallel Processors
DOI10.1137/0219051zbMATH Open0697.68028OpenAlexW2025300971MaRDI QIDQ3474880FDOQ3474880
Authors: Ashfaq A. Munshi, Barbara B. Simons
Publication date: 1990
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0219051
Recommendations
- Scheduling for parallel processing
- scientific article; zbMATH DE number 838793
- Scheduling on parallel processors with varying processing times
- Parallel processor scheduling with delay constraints
- Speculative parallelization of sequential loops on multicores
- scientific article; zbMATH DE number 512819
- Scheduling Interval Ordered Tasks in Parallel
- scientific article; zbMATH DE number 5049925
parallel computingscheduling problemprecedence constraintscompilerAutomatic parallelizationdependencessequential code
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)
Cited In (32)
- Spectral Analysis of an Oscillating Thermoviscoelastic Plate in a Transverse Magnetic Field
- Title not available (Why is that?)
- Title not available (Why is that?)
- Speedup studies of leading iteration model for non-DO loops in comparison with sequential iteration model
- Parallel scheduling of recursively defined arrays
- Title not available (Why is that?)
- Some Notes on Speeding Up Certain Loops by Software, Firmware, and Hardware Means
- Title not available (Why is that?)
- Data dependent loop scheduling based on genetic algorithms for distributed and shared memory systems
- Title not available (Why is that?)
- Scalable and structured scheduling
- On parallelization of UET/UET-UCT loops
- Title not available (Why is that?)
- Code reorganization using the data dependence graph for vector-pipeline computers
- Title not available (Why is that?)
- The importance of prepass code scheduling for superscalar and superpipelined processors
- Processor Scheduling for Linearly Connected Parallel Processors
- On the optimality of Feautrier's scheduling algorithm
- A theory of compaction-based parallelization
- A convergence proof of FGDLS when the woarkload is monotone
- The complexity of a cyclic scheduling problem with identical machines and precedence constraints
- A study of the cyclic scheduling problem on parallel processors
- Loop skewing: the wavefront method revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- Loading and Sequencing on Parallel Machines
- Structured partitioning of concurrent programs for execution on multiprocessors
- Task ordering and memory management problem for degree of parallelism estimation
- EXPLORER: Supporting run-time parallelization of DOACROSS loops on general networks of workstations
- Title not available (Why is that?)
- An algorithm for maximum desequencing of repetition-free loops
- Scheduling loops with partial loop-carried dependencies
Uses Software
This page was built for publication: Scheduling Sequential Loops on Parallel Processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474880)