Open access peer-reviewed chapter

Provably-Efficient Online Adaptive Scheduling of Parallel Jobs Based on Simple Greedy Rules

By Yuxiong He, and Wen-Jing Hsu

Published: November 1st 2008

DOI: 10.5772/6341

Downloaded: 1926

How to cite and reference

Link to this chapter Copy to clipboard

Cite this chapter Copy to clipboard

Yuxiong He, and Wen-Jing Hsu (November 1st 2008). Provably-Efficient Online Adaptive Scheduling of Parallel Jobs Based on Simple Greedy Rules, Greedy Algorithms, Witold Bednorz, IntechOpen, DOI: 10.5772/6341. Available from:

chapter statistics

1926total chapter downloads

More statistics for editors and authors

Login to your personal dashboard for more detailed statistics on your publications.

Access personal reporting

Related Content

This Book

Next chapter

Quasi-Concave Functions and Greedy Algorithms

By Yulia Kempner, Vadim E. Levit and Ilya Muchnik

Related Book

First chapter

Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches

By Rajesh Matai, Surya Singh and Murari Lal Mittal

We are IntechOpen, the world's leading publisher of Open Access books. Built by scientists, for scientists. Our readership spans scientists, professors, researchers, librarians, and students, as well as business professionals. We share our knowledge and peer-reveiwed research papers with libraries, scientific and engineering societies, and also work with corporate R&D departments and government entities.

More about us