{"id":{"repo_id":"windsor","oai_identifier":"oai:uwindsor.scholaris.ca:20.500.14776/6896"},"canonical_url":"https://search.dev.ndltd.org/etd/windsor/oai:uwindsor.scholaris.ca:20.500.14776/6896","repository":{"repo_id":"windsor","name":"University of Windsor","base_url":"https://uwindsor.scholaris.ca/server/oai/request"},"display":{"title":"Extending Scojo-PECT by migration based on application level checkpointing","abstract":"In parallel computing, jobs have different runtimes and required computation resources. With runtimes correlated with resources, scheduling these jobs would be a packing problem getting the utilization and total execution time varies. Sometimes, resources are idle while jobs are preempted or have resource conflict with no chance to take use of them. This greatly wastes system resource at certain degree. Here we propose an approach which takes periodic checkpoints of running jobs with the chance to take advantage of migration to optimize our scheduler during long term scheduling. We improve our original Scojo-PECT preemptive scheduler which does not have checkpoint support before. We evaluate the gained execution time minus overhead of checkpointing/migration, to make comparison with original execution time.","abstract_html":"In parallel computing, jobs have different runtimes and required computation resources. With runtimes correlated with resources, scheduling these jobs would be a packing problem getting the utilization and total execution time varies. Sometimes, resources are idle while jobs are preempted or have resource conflict with no chance to take use of them. This greatly wastes system resource at certain degree. Here we propose an approach which takes periodic checkpoints of running jobs with the chance to take advantage of migration to optimize our scheduler during long term scheduling. We improve our original Scojo-PECT preemptive scheduler which does not have checkpoint support before. We evaluate the gained execution time minus overhead of checkpointing/migration, to make comparison with original execution time.","abstract_has_math":false,"creators":["Shi, Jiaying"],"institution":"University of Windsor","degree_name":"M.Sc.","degree_level":"Masters","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["olsenc@uwindsor.ca"],"advisors":["Sodan, Angela C."],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009-01-01","date_published":"2009-01-01","updated_at":"2026-07-27T22:04:46Z","subjects":[],"languages":["en_CA"],"rights":[],"rights_urls":["http://creativecommons.org/licenses/by-nc-nd/4.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/20.500.14776/6896","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["olsenc@uwindsor.ca"]},{"key":"dc:contributor.advisor","label":"Advisor","values":["Sodan, Angela C."]},{"key":"dc:creator","label":"Author","values":["Shi, Jiaying"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2025-07-03 13:58"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2019-12-18 12:53","2025-07-03T17:58:48Z"]},{"key":"dc:date.issued","label":"Date","values":["2009-01-01"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/masterThesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.Sc."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Windsor"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_CA"]},{"key":"dc:rights","label":"Dc Rights","values":["http://creativecommons.org/licenses/by-nc-nd/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/20.500.14776/6896"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In parallel computing, jobs have different runtimes and required computation resources. With runtimes correlated with resources, scheduling these jobs would be a packing problem getting the utilization and total execution time varies. Sometimes, resources are idle while jobs are preempted or have resource conflict with no chance to take use of them. This greatly wastes system resource at certain degree. Here we propose an approach which takes periodic checkpoints of running jobs with the chance to take advantage of migration to optimize our scheduler during long term scheduling. We improve our original Scojo-PECT preemptive scheduler which does not have checkpoint support before. We evaluate the gained execution time minus overhead of checkpointing/migration, to make comparison with original execution time."]},{"key":"dc:title","label":"Title","values":["Extending Scojo-PECT by migration based on application level checkpointing"]}]}],"canonical_facts":{"dc:contributor":["olsenc@uwindsor.ca"],"dc:contributor.advisor":["Sodan, Angela C."],"dc:creator":["Shi, Jiaying"],"dc:date.accessioned":["2025-07-03 13:58"],"dc:date.available":["2019-12-18 12:53","2025-07-03T17:58:48Z"],"dc:date.issued":["2009-01-01"],"dc:description.abstract":["In parallel computing, jobs have different runtimes and required computation resources. With runtimes correlated with resources, scheduling these jobs would be a packing problem getting the utilization and total execution time varies. Sometimes, resources are idle while jobs are preempted or have resource conflict with no chance to take use of them. This greatly wastes system resource at certain degree. Here we propose an approach which takes periodic checkpoints of running jobs with the chance to take advantage of migration to optimize our scheduler during long term scheduling. We improve our original Scojo-PECT preemptive scheduler which does not have checkpoint support before. We evaluate the gained execution time minus overhead of checkpointing/migration, to make comparison with original execution time."],"dc:identifier.uri":["https://hdl.handle.net/20.500.14776/6896"],"dc:language.iso":["en_CA"],"dc:rights":["http://creativecommons.org/licenses/by-nc-nd/4.0/"],"dc:title":["Extending Scojo-PECT by migration based on application level checkpointing"],"dc:type":["info:eu-repo/semantics/masterThesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Masters"],"thesis:degree_name":["M.Sc."],"thesis:institution_name":["University of Windsor"]},"updated_at":"2026-07-27T22:04:46Z"}