Scheduling Multipipeline and Multiprocessor Computers

DOI10.1109/TC.1984.5009337MaRDI QIDQ3321443zbMATH OpenOpenAlexFDO

Authors Sartaj Sahni

Publication date 1984

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1984.5009337

zbMATH Keywords

asynchronous processorsheuristicsmultiprocessors

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3991267
• Scheduling multiprocessor tasks on hypercubes
• Scheduling independent multiprocessor tasks
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• scientific article; zbMATH DE number 1729263

Cited in

(11)

• Thrifty execution of task pipelines
• Particle creation in a cosmological anisotropic universe
• Novel neighborhood search for multiprocessor scheduling with pipelining
• Guest editorial: Multiprocessor scheduling
• Scheduling of pipelined operator graphs
• Performance of local search heuristics on scheduling a class of pipelined multiprocessor tasks
• The master-slave paradigm in parallel computer and industrial settings
• scientific article; zbMATH DE number 1729263 (Why is no real title available?)
• scientific article; zbMATH DE number 4172355 (Why is no real title available?)
• scientific article; zbMATH DE number 4080896 (Why is no real title available?)
• Scheduling master-slave multiprocessor systems

This page was built for publication: Scheduling Multipipeline and Multiprocessor Computers

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