{"id":{"repo_id":"usf","oai_identifier":"oai:digitalcommons.usf.edu:etd-1827"},"canonical_url":"https://search.ndltd.org/etd/usf/oai:digitalcommons.usf.edu:etd-1827","repository":{"repo_id":"usf","name":"University of South Florida","base_url":"https://digitalcommons.usf.edu/do/oai/"},"display":{"title":"A Game Theoretic Framework for Dynamic Task Scheduling in Distributed Heterogeneous Computing Systems","abstract":"Heterogeneous Computing (HC) systems achieve high performance by networking together computing resources of diverse nature. The issues of task assignment and scheduling are critical in the design and performance of such systems. In this thesis, an auction based game theoretic framework is developed for dynamic task scheduling in HC systems. Based on the proposed game theoretic model, a new dynamic scheduling algorithm is developed that uses auction based strategies. The dynamic scheduling algorithm yields schedules with shorter completion times than static schedulers while incurring higher scheduling overhead. Thus, a second scheduling algorithm is proposed which uses an initial schedule generated with a learning automaton based algorithm, and then heuristics are used to identify windows of tasks within the application that can be rescheduled dynamically during run time.","abstract_html":"Heterogeneous Computing (HC) systems achieve high performance by networking together computing resources of diverse nature. The issues of task assignment and scheduling are critical in the design and performance of such systems. In this thesis, an auction based game theoretic framework is developed for dynamic task scheduling in HC systems. Based on the proposed game theoretic model, a new dynamic scheduling algorithm is developed that uses auction based strategies. The dynamic scheduling algorithm yields schedules with shorter completion times than static schedulers while incurring higher scheduling overhead. Thus, a second scheduling algorithm is proposed which uses an initial schedule generated with a learning automaton based algorithm, and then heuristics are used to identify windows of tasks within the application that can be rescheduled dynamically during run time.","abstract_has_math":false,"creators":["Ramesh, Vasanth Kumar"],"institution":"University of South Florida","degree_name":null,"degree_level":"Thesis","degree_discipline":"Computer Engineering","degree_department":null,"school":null,"contributors":["N. Ranganathan Ph.D.","Srinivas Katkoori Ph.D.","Soontae Kim Ph.D."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2005,"date_issued":"2005-04-08T07:00:00Z","date_published":"2005-04-08T07:00:00Z","updated_at":"2026-11-19T08:39:27Z","subjects":["Variable Structure Stochastic Automation","Game Theory","Nash Equilibrium","Auctions","Task Assignment","American Studies","Arts and Humanities"],"languages":["EN-US"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usf.edu/etd/828","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usf.edu/etd/828","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usf.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usf.edu%3Aetd-1827","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["N. Ranganathan Ph.D.","Srinivas Katkoori Ph.D.","Soontae Kim Ph.D."]},{"key":"dc:creator","label":"Author","values":["Ramesh, Vasanth Kumar"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2005-04-08T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis","M.S.Cp.E."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of South Florida"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Variable Structure Stochastic Automation","Game Theory","Nash Equilibrium","Auctions","Task Assignment","American Studies","Arts and Humanities"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["EN-US"]},{"key":"dc:rights.license","label":"Dc Rights License","values":["default"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usf.edu/etd/828"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Heterogeneous Computing (HC) systems achieve high performance by networking together computing resources of diverse nature. The issues of task assignment and scheduling are critical in the design and performance of such systems. In this thesis, an auction based game theoretic framework is developed for dynamic task scheduling in HC systems. Based on the proposed game theoretic model, a new dynamic scheduling algorithm is developed that uses auction based strategies. The dynamic scheduling algorithm yields schedules with shorter completion times than static schedulers while incurring higher scheduling overhead. Thus, a second scheduling algorithm is proposed which uses an initial schedule generated with a learning automaton based algorithm, and then heuristics are used to identify windows of tasks within the application that can be rescheduled dynamically during run time."]},{"key":"dc:title","label":"Title","values":["A Game Theoretic Framework for Dynamic Task Scheduling in Distributed Heterogeneous Computing Systems"]}]}],"canonical_facts":{"dc:contributor":["N. Ranganathan Ph.D.","Srinivas Katkoori Ph.D.","Soontae Kim Ph.D."],"dc:creator":["Ramesh, Vasanth Kumar"],"dc:date":["2005-04-08T07:00:00Z"],"dc:description":["Heterogeneous Computing (HC) systems achieve high performance by networking together computing resources of diverse nature. The issues of task assignment and scheduling are critical in the design and performance of such systems. In this thesis, an auction based game theoretic framework is developed for dynamic task scheduling in HC systems. Based on the proposed game theoretic model, a new dynamic scheduling algorithm is developed that uses auction based strategies. The dynamic scheduling algorithm yields schedules with shorter completion times than static schedulers while incurring higher scheduling overhead. Thus, a second scheduling algorithm is proposed which uses an initial schedule generated with a learning automaton based algorithm, and then heuristics are used to identify windows of tasks within the application that can be rescheduled dynamically during run time."],"dc:identifier":["https://digitalcommons.usf.edu/etd/828"],"dc:language":["EN-US"],"dc:rights.license":["default"],"dc:subject":["Variable Structure Stochastic Automation","Game Theory","Nash Equilibrium","Auctions","Task Assignment","American Studies","Arts and Humanities"],"dc:title":["A Game Theoretic Framework for Dynamic Task Scheduling in Distributed Heterogeneous Computing Systems"],"thesis:degree_discipline":["Computer Engineering"],"thesis:degree_level":["Thesis","M.S.Cp.E."],"thesis:institution_name":["University of South Florida"]},"updated_at":"2026-11-19T08:39:27Z"}