Improving throughput and utilization in parallel machines through concurrent gang

@article{Silva2000ImprovingTA,
  title={Improving throughput and utilization in parallel machines through concurrent gang},
  author={Fabr{\'i}cio Alves Barbosa da Silva and Isaac D. Scherson},
  journal={Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000},
  year={2000},
  pages={121-126}
}
In this paper we propose a new class of scheduling policies, dubbed Concurrent Gang, that combines the advantages of gang scheduling for communication and synchronization intensive parallel jobs with the flexibility of a Unix scheduler for sequential and I/O intensive jobs. Besides that, scalability in Concurrent Gang is achieved through the use of a global synchronizer that coordinates the gang scheduler among different processors. Simulation results are provided comparing the performance of… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

Tasks management of manned space ground data processing based on OSWorkflow engine and Web Services

  • 2017 3rd IEEE International Conference on Computer and Communications (ICCC)
  • 2017
VIEW 1 EXCERPT
CITES METHODS

Scheduling a job mix in a partitionable parallel system

  • Proceedings 35th Annual Simulation Symposium. SS 2002
  • 2002
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

Modeling of Workloads in MPP. Job Scheduling Strategies for Parallel Processing

J. Jann
  • LNCS 1291:95–116,
  • 1997
VIEW 1 EXCERPT

Modeling of Workloads in MPP. Job Scheduling Strategies for Parallel Processing

J. Jann
  • LNCS 1291:95–116,
  • 1997
VIEW 1 EXCERPT

Nonclairvoyant scheduling

R. Motwani, S. Phillips, E. Torng
  • Theoretical Computer Science, 130(1):17–47
  • 1994
VIEW 1 EXCERPT