The master-slave paradigm in parallel computer and industrial settings

DOI10.1007/BF00121679zbMath0866.90077OpenAlexW1969147734MaRDI QIDQ2564882

George L. Vairaktarakis, Sartaj K. Sahni

Publication date: 7 January 1997

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00121679

zbMATH Keywords

master-slave paradigmbounded performance approximation algorithmsparallel computer schedulingpostprocessing taskpreprocessing taskslave taskunconstrained makespan minimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

Analytical estimation of the scalability of iterative numerical algorithms on distributed memory multiprocessors ⋮ Scalable parallel algorithm for solving non-stationary systems of linear inequalities ⋮ Scheduling problems in master-slave model ⋮ Machine scheduling with deliveries to multiple customer locations ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Preemptive scheduling of independent jobs on a hypercube
• Scheduling independent jobs on partitionable hypercubes
• Minimizing makespan in hybrid flowshops
• Sequencing n Jobs on Two Machines with Arbitrary Time Lags
• Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags
• Scheduling Multipipeline and Multiprocessor Computers
• Characterisation of programs for scheduling in multiprogrammed parallel systems
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On some sequencing problems

This page was built for publication: The master-slave paradigm in parallel computer and industrial settings