Thread scheduling for multiprogrammed multiprocessors

DOI10.1007/S00224-001-0004-ZMaRDI QIDQ5946213zbMATH OpenOpenAlexFDO

Authors N. S. Arora, R. D. Blumofe, C. G. Plaxton

Publication date 14 October 2001

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-001-0004-z

zbMATH Keywords

shared-memory multiprocessorsthread scheduler

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Recommendations

• Scheduling algorithms for strict multithreaded computations
• Efficient scheduling of strict multithreaded computations
• On multiprocessor system scheduling
• Scheduling multiprocessor tasks -- An overview
• Space-Efficient Scheduling of Multithreaded Computations
• scientific article; zbMATH DE number 1543369
• scientific article; zbMATH DE number 1979516
• scientific article; zbMATH DE number 42110

Cited in

(37)

• Gang scheduling performance benefits for fine-grain synchronization
• Efficient scheduling of strict multithreaded computations
• Scheduling threads for low space requirement and good locality
• A comparative analysis of fine-grain threads packages
• Evaluation of design choices for gang scheduling using distributed hierarchical control
• A dynamic-sized nonblocking work stealing deque
• Open problems in queueing theory inspired by datacenter computing
• Scheduling computations with provably low synchronization overheads
• Protocol scheduling
• Extending the wait-free hierarchy to multi-threaded systems
• A mechanized refinement proof of the Chase-Lev deque using a proof system
• Specification and verification of concurrent programs through refinements
• Built-in coloring for highly-concurrent doubly-linked lists
• Supporting microthread scheduling and synchronisation in CMPs
• Upper bounds on number of steals in rooted trees
• Novel fairness-aware co-scheduling for shared cache contention game on chip multiprocessors
• Lesser Bear -- a light-weight process library for SMP computers
• Verification of Concurrent Programs on Weak Memory Models
• Decentralized list scheduling
• Characterisation of programs for scheduling in multiprogrammed parallel systems
• Space-efficient scheduling of stochastically generated tasks
• scientific article; zbMATH DE number 1196838 (Why is no real title available?)
• TPF: a dynamic system thrashing protection facility
• scientific article; zbMATH DE number 1955852 (Why is no real title available?)
• An Approximate Analysis of a UNIX Macro Process Scheduler
• scientific article; zbMATH DE number 1543369 (Why is no real title available?)
• Lesser Bear: A lightweight process library for SMP computers?scheduling mechanism without a lock operation
• scientific article; zbMATH DE number 1863251 (Why is no real title available?)
• scientific article; zbMATH DE number 1863298 (Why is no real title available?)
• scientific article; zbMATH DE number 1863306 (Why is no real title available?)
• Round robin thread selection optimization in multithreaded processors
• Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
• Algorithm Theory - SWAT 2004
• Oracle-guided scheduling for controlling granularity in implicitly parallel languages
• Performance driven distributed scheduling of parallel hybrid computations
• It's hard to HAC average linkage!
• Parallel joinable B-trees in the fork-join I/O model

This page was built for publication: Thread scheduling for multiprogrammed multiprocessors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946213)