Scheduling problems in master-slave model

  title={Scheduling problems in master-slave model},
  author={Joseph Y.-T. Leung and Hairong Zhao},
  journal={Annals of Operations Research},
Abstract We consider scheduling problems in the master slave model, which was introduced by Sahni in 1996. The goal is to minimize the makespan and the total completion time. It has been shown that the problem of minimizing makespan is NP-hard. Sahni and Vairaktarakis developed some approximation algorithms to generate schedules whose makespan is at most constant times the optimal. In this paper, we show that the problem of minimizing total completion time is NP-hard in the strong sense. Then… 

Analytical study of the "master-worker" framework scalability on multiprocessors with distributed memory

An analytical study of the "master-worker" framework scalability on multiprocessors with distributed memory with a new model of parallel computations called BSF, based on BSP and SPMD models is proposed.

Scalability Evaluation of NSLP Algorithm for Solving Non-Stationary Linear Programming Problems on Cluster Computing Systems

On the basis of the BSF cost metric, the upper bound of the NSLP algorithm scalability is derived and its parallel efficiency is estimated and a comparison of scalability estimations obtained analytically and experimentally is provided.

Improving Parallel Computing Efficiency

This paper describes a software Q-system for studying the parallelism resource of numerical algorithms and suggests a method for designing of parallel programs for numerical algorithms called Q-effective.

Verification of BSF Parallel Computational Model

The article is devoted to the verification of the BSF parallel computing model, an evolution of the "master-slave" model and SPMD-model, which is oriented to iterative algorithms that are implemented in cluster computing systems.

High-Performance Computing Using Application of Q-determinant of Numerical Algorithms

The application of the Q-determinant to determine the parallelism resource of numerical algorithms and to develop Q-effective programs is described to increase the efficiency of implementing numerical algorithms on parallel computing systems.

Модель параллельных вычислений для многопроцессорных систем с распределенной памятью

This document is intended to help clarify the role of acronyms in the history of BSF, as well as provide some context for future references.



Minimizing sum of completion times and makespan in master-slave systems

These are the first general results for the minsum problem in the master-slave model, and it is shown that these algorithms generate schedules with small makespan as well.

Minimizing mean flowtime and makespan on master-slave systems

Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

It is shown that the problem of minimizing the makespan in a two-machine flow shop can be solved in O(n log n) time and that this is even the case if all processing times are equal to one.

Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time

The problem of scheduling independent jobs on several serial workshops consisting of identical parallel machines is studied. Each job is processed by one machine in each workshop. This workshop

Analysis of scheduling algorithms for master–slave systems

For the problem of minimizing makespan in master–slave systems with multiple masters, heuristic algorithms with good bounded performance are developed, for all three order specifications.

Minimizing average completion time in the presence of release dates

This paper gives the first constant-factor approximation algorithms for several variants of the single and parallel machine models and generalizes to the minimization of averageweighted completion time as well.

The master-slave paradigm in parallel computer and industrial settings

This paper motivates the master-slave model and develops bounded performance approximation algorithms for the unconstrained makespan minimization problem as well as for multiple master systems.

Improved Scheduling Algorithms for Minsum Criteria

This work provides improved performance guarantees for several of the most basic scheduling models, and gives the first constant performance guarantee for a number of more realistically constrained scheduling problems.

Approximation techniques for average completion time scheduling

It is shown that a preemptive one-machine relaxation is a powerful tool for designing parallel machine scheduling algorithms that simultaneously produce good approximations and have small running times, and a general theorem relating the value of one- machine relaxations to that of the schedules obtained for the original m-machine problems is proved.