{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/23750"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/23750","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Job scheduling on high performance computer systems: Complexity and algorithms","abstract":"The problem of job scheduling on Partitionable Massively Parallel Processor (PMPP) Systems is studied in this dissertation. The objective of the scheduling problem is to minimize the makespan or the total completion time. Key system features include the following: (1) the number of processors K is large relative to the number of jobs n (K $\\ge$ 2n), (2) the processing time of a job depends on the number of processors assigned to it, and (3) unlimited repartitioning of the processors is allowed.","abstract_html":"The problem of job scheduling on Partitionable Massively Parallel Processor (PMPP) Systems is studied in this dissertation. The objective of the scheduling problem is to minimize the makespan or the total completion time. Key system features include the following: (1) the number of processors K is large relative to the number of jobs n (K $\\ge$ 2n), (2) the processing time of a job depends on the number of processors assigned to it, and (3) unlimited repartitioning of the processors is allowed.","abstract_has_math":true,"creators":["Zhang, Yi"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Engineering, Industrial","degree_department":null,"school":null,"contributors":["Palekar, Udatta S.","Johnson, M.A."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T14:25:41Z","date_published":"2011-05-07T14:25:41Z","updated_at":"2026-07-22T22:25:22Z","subjects":["Engineering, Industrial","Operations Research","Computer Science"],"languages":["eng"],"rights":["Copyright 1995 Zhang, Yi"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9624547","(UMI)AAI9624547"],"render_values":[{"text":"AAI9624547","href":null,"code":true},{"text":"(UMI)AAI9624547","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/23750","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Palekar, Udatta S.","Johnson, M.A."]},{"key":"dc:creator","label":"Author","values":["Zhang, Yi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T14:25:41Z","10000-01-01","1995"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Engineering, Industrial","Operations Research","Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Industrial","Operations Research","Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1995 Zhang, Yi"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9624547","(UMI)AAI9624547","http://hdl.handle.net/2142/23750"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The problem of job scheduling on Partitionable Massively Parallel Processor (PMPP) Systems is studied in this dissertation. The objective of the scheduling problem is to minimize the makespan or the total completion time. Key system features include the following: (1) the number of processors K is large relative to the number of jobs n (K $\\ge$ 2n), (2) the processing time of a job depends on the number of processors assigned to it, and (3) unlimited repartitioning of the processors is allowed.","Three types of speedup functions are considered: linear, sublinear, and superlinear. While simple rules are found to solve problems with linear and sublinear speedup functions, the superlinear rate function, which is most common, leads to an NP-hard problem. A Processor Partition Algorithm (PP) based on the results of a continuous-resource scheduling problem is developed for this problem. It is proved that Algorithm PP finds the best schedule among all parallel schedules. Moreover, Algorithm PP has a tight worst case absolute performance bound of 1 + 1/$\\theta$ when the speedup function is concave and superlinear. ($\\theta$ = $K\\over n$ $-$ 1) Several variants of Algorithm PP are developed. Simulation shows that significant performance improvement can be obtained by using these variants. PMPP systems with a mesh-topology are also considered. Extension of Algorithm PP to this topology indicates that the absolute worst case performance bound is also 1 + 1/$\\theta$. A hybrid 2-partition-Algorithm PP variant is shown to perform better than a one-dimension-fixed heuristic in simulation studies. More computational results are presented to show the effect of different parameters on the makespan.","This dissertation also studies a high performance multiprocessor time-sharing computing system. A new job loading policy is developed for this system. The importance of using information on job resource requirements to prioritize and limit jobs admitted into the kernel is illustrated through simulation model. The simulation study is based on a stationary model of a computing system as well as on a model using nonstationary historical data from NCSA's Cray-YMP system.","Made available in DSpace on 2011-05-07T14:25:41Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9624547.pdf: 5519257 bytes, checksum: 3c648ce9ca7be6e130b57288f51ea0b3 (MD5) Previous issue date: 1995","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T15:06:35Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:31:59-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Job scheduling on high performance computer systems: Complexity and algorithms"]}]}],"canonical_facts":{"dc:contributor":["Palekar, Udatta S.","Johnson, M.A."],"dc:creator":["Zhang, Yi"],"dc:date":["2011-05-07T14:25:41Z","10000-01-01","1995"],"dc:description":["The problem of job scheduling on Partitionable Massively Parallel Processor (PMPP) Systems is studied in this dissertation. The objective of the scheduling problem is to minimize the makespan or the total completion time. Key system features include the following: (1) the number of processors K is large relative to the number of jobs n (K $\\ge$ 2n), (2) the processing time of a job depends on the number of processors assigned to it, and (3) unlimited repartitioning of the processors is allowed.","Three types of speedup functions are considered: linear, sublinear, and superlinear. While simple rules are found to solve problems with linear and sublinear speedup functions, the superlinear rate function, which is most common, leads to an NP-hard problem. A Processor Partition Algorithm (PP) based on the results of a continuous-resource scheduling problem is developed for this problem. It is proved that Algorithm PP finds the best schedule among all parallel schedules. Moreover, Algorithm PP has a tight worst case absolute performance bound of 1 + 1/$\\theta$ when the speedup function is concave and superlinear. ($\\theta$ = $K\\over n$ $-$ 1) Several variants of Algorithm PP are developed. Simulation shows that significant performance improvement can be obtained by using these variants. PMPP systems with a mesh-topology are also considered. Extension of Algorithm PP to this topology indicates that the absolute worst case performance bound is also 1 + 1/$\\theta$. A hybrid 2-partition-Algorithm PP variant is shown to perform better than a one-dimension-fixed heuristic in simulation studies. More computational results are presented to show the effect of different parameters on the makespan.","This dissertation also studies a high performance multiprocessor time-sharing computing system. A new job loading policy is developed for this system. The importance of using information on job resource requirements to prioritize and limit jobs admitted into the kernel is illustrated through simulation model. The simulation study is based on a stationary model of a computing system as well as on a model using nonstationary historical data from NCSA's Cray-YMP system.","Made available in DSpace on 2011-05-07T14:25:41Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9624547.pdf: 5519257 bytes, checksum: 3c648ce9ca7be6e130b57288f51ea0b3 (MD5) Previous issue date: 1995","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T15:06:35Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:31:59-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["AAI9624547","(UMI)AAI9624547","http://hdl.handle.net/2142/23750"],"dc:language":["eng"],"dc:rights":["Copyright 1995 Zhang, Yi"],"dc:subject":["Engineering, Industrial","Operations Research","Computer Science"],"dc:title":["Job scheduling on high performance computer systems: Complexity and algorithms"],"dc:type":["text"],"thesis:degree_discipline":["Engineering, Industrial","Operations Research","Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:22Z"}