article · 2007

Processor Allocation and Scheduling in

Distributed Systems Mohankumar, Mohankumar Zade, Nihal Ch, Pradip Bepari

Cited by 0Abstract and details only

Abstract

this paper. This section also comments on the difference between the terms processor allocation and scheduling in context of distribute systems. Section III attempts to categorize the algorithms proposed in various categories for better understanding, comparison and future works. In section IV some example algorithms are discussed and section V briefly describes some example processor allocation algorithms of various classes. section VI presents co-scheduling algorithm. Lastly, summary and conclusions are presented in section VII

Cite this paper

APA 7

Mohankumar, D. S., Zade, M., Ch, N., & Bepari, P. (2007). Processor Allocation and Scheduling in.

MLA 9

Mohankumar, Distributed Systems, et al. “Processor Allocation and Scheduling in.” 2007.

Chicago

Mohankumar, Distributed Systems, Mohankumar Zade, Nihal Ch, and Pradip Bepari. 2007. “Processor Allocation and Scheduling in.”

Harvard

Mohankumar, D.S. et al. (2007) ‘Processor Allocation and Scheduling in’.

BibTeX

@article{mohankumar2007processor,
  title = {{Processor Allocation and Scheduling in}},
  author = {Mohankumar, Distributed Systems and Zade, Mohankumar and Ch, Nihal and Bepari, Pradip},
  year = {2007}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.