In this paper, we provide an analytical overview of a myriad of scheduling algorithms. Three of these algorithms were designed and implemented in an object-oriented language, namely C++, and they are the First-Come First-Served (FCFS), the Round-Robin (RR), and the Shortest Time to Completion (STCF) scheduling policies. According to various testing criteria, the most efficient algorithms turned out to be the FCFS and the RR algorithms, although the latter has to be utilized with quite a small time slice.
Interesting Quote"Simply stated, it is sagacious to eschew obfuscation."
Rami S. Abielmona
School of Information Technology and Engineering (SITE), University of Ottawa
800 King Edward Ave., P.O. Box 450, Stn A,
Ottawa, Ontario, Canada, K1N 6N5
Tel: (613) 562-5800 ext. 2197, Fax: (613) 562-5175
Office/Lab: SITE Building, Room 3010
Contactez: L'École d'ingénierie et de technologie de l'information /
Contact: School of Information Technology and Engineering
Copyright © 2002 Université d'Ottawa / University of Ottawa
Webmestre / Webmaster