Analysis of First-Come-First-Serve Parallel Job Scheduling

@inproceedings{Schwiegelshohn1998AnalysisOF,
  title={Analysis of First-Come-First-Serve Parallel Job Scheduling},
  author={Uwe Schwiegelshohn and Ramin Yahyapour},
  booktitle={SODA},
  year={1998}
}
This paper analyzes job scheduling for parallel computers by using theoretical and experimental means Based on exist ing architectures we rst present a machine and a job model Then we propose a simple on line algorithm employing job preemption without migration and derive theoretical bounds for the performance of the algorithm The algorithm is ex perimentally evaluated with trace data from a large comput ing facility These experiments show that the algorithm is highly sensitive on parameter… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 149 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 82 extracted citations

149 Citations

01020'98'02'07'12'17
Citations per Year
Semantic Scholar estimates that this publication has 149 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…