{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/23298"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/23298","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Circuit-switched multicomputers and heuristic load placement","abstract":"In this thesis, we examine two areas germane to ensemble, or multicomputer, systems: communication between individual computers and the placement of the individual components of a parallel program in the ensemble. These topics are related. Programs that execute on ensemble systems must be partitioned, and those components must communicate to be effective. We assume the raison d'etre of ensemble systems is performance; the methods used to solve problems, and the implementation of those methods on an ensemble system depend on the communication and computational performance of the ensemble system.","abstract_html":"In this thesis, we examine two areas germane to ensemble, or multicomputer, systems: communication between individual computers and the placement of the individual components of a parallel program in the ensemble. These topics are related. Programs that execute on ensemble systems must be partitioned, and those components must communicate to be effective. We assume the raison d'etre of ensemble systems is performance; the methods used to solve problems, and the implementation of those methods on an ensemble system depend on the communication and computational performance of the ensemble system.","abstract_has_math":false,"creators":["Grunwald, Dirk Claus"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Reed, Daniel"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T14:09:12Z","date_published":"2011-05-07T14:09:12Z","updated_at":"2026-07-22T22:25:21Z","subjects":["Computer Science"],"languages":["eng"],"rights":["Copyright 1989 Grunwald, Dirk Claus"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9010869","(UMI)AAI9010869"],"render_values":[{"text":"AAI9010869","href":null,"code":true},{"text":"(UMI)AAI9010869","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/23298","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Reed, Daniel"]},{"key":"dc:creator","label":"Author","values":["Grunwald, Dirk Claus"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T14:09:12Z","10000-01-01","1989"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["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":["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 1989 Grunwald, Dirk Claus"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9010869","(UMI)AAI9010869","http://hdl.handle.net/2142/23298"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In this thesis, we examine two areas germane to ensemble, or multicomputer, systems: communication between individual computers and the placement of the individual components of a parallel program in the ensemble. These topics are related. Programs that execute on ensemble systems must be partitioned, and those components must communicate to be effective. We assume the raison d'etre of ensemble systems is performance; the methods used to solve problems, and the implementation of those methods on an ensemble system depend on the communication and computational performance of the ensemble system.","However, such performance has a price; the programming model for ensemble systems differs greatly from the shared memory paradigm to which we have grown accustomed. Programming languages and tools that simplify the process of partitioning and placing individual parts of a computation are needed. In this thesis, we show that simple strategies used to share the resources of an ensemble system between individual program components, or processes, are very effective.","We measure the performance of existing ensemble computer architectures and compare existing network architectures. We analyse several routing algorithms for circuit switched ensembles. These algorithms are simple enough to allow hardware implementation with switching speeds less than five hundred nanoseconds. We compare these networks to existing and proposed networks.","We use the network model to examine process placement on an ensemble system. We characterize the observable behavior of processes; this is used to generate synthetic workloads for a simulation of process placement. We also capture the observational behavior of parallel prolog programs and two search tree programs. The conclusions from our study show that, with an appropriate network model, random process distribution is sufficient; in fact, process distribution using knowledge of the current system state is generally penalized due to stale information and information overflow.","Made available in DSpace on 2011-05-07T14:09:12Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9010869.pdf: 8503453 bytes, checksum: 0c00d5e5f20e467dbd0f1900fdf105b4 (MD5) Previous issue date: 1989","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T15:03:32Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:30:17-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":["Circuit-switched multicomputers and heuristic load placement"]}]}],"canonical_facts":{"dc:contributor":["Reed, Daniel"],"dc:creator":["Grunwald, Dirk Claus"],"dc:date":["2011-05-07T14:09:12Z","10000-01-01","1989"],"dc:description":["In this thesis, we examine two areas germane to ensemble, or multicomputer, systems: communication between individual computers and the placement of the individual components of a parallel program in the ensemble. These topics are related. Programs that execute on ensemble systems must be partitioned, and those components must communicate to be effective. We assume the raison d'etre of ensemble systems is performance; the methods used to solve problems, and the implementation of those methods on an ensemble system depend on the communication and computational performance of the ensemble system.","However, such performance has a price; the programming model for ensemble systems differs greatly from the shared memory paradigm to which we have grown accustomed. Programming languages and tools that simplify the process of partitioning and placing individual parts of a computation are needed. In this thesis, we show that simple strategies used to share the resources of an ensemble system between individual program components, or processes, are very effective.","We measure the performance of existing ensemble computer architectures and compare existing network architectures. We analyse several routing algorithms for circuit switched ensembles. These algorithms are simple enough to allow hardware implementation with switching speeds less than five hundred nanoseconds. We compare these networks to existing and proposed networks.","We use the network model to examine process placement on an ensemble system. We characterize the observable behavior of processes; this is used to generate synthetic workloads for a simulation of process placement. We also capture the observational behavior of parallel prolog programs and two search tree programs. The conclusions from our study show that, with an appropriate network model, random process distribution is sufficient; in fact, process distribution using knowledge of the current system state is generally penalized due to stale information and information overflow.","Made available in DSpace on 2011-05-07T14:09:12Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9010869.pdf: 8503453 bytes, checksum: 0c00d5e5f20e467dbd0f1900fdf105b4 (MD5) Previous issue date: 1989","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T15:03:32Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:30:17-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":["AAI9010869","(UMI)AAI9010869","http://hdl.handle.net/2142/23298"],"dc:language":["eng"],"dc:rights":["Copyright 1989 Grunwald, Dirk Claus"],"dc:subject":["Computer Science"],"dc:title":["Circuit-switched multicomputers and heuristic load placement"],"dc:type":["text"],"thesis:degree_discipline":["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:21Z"}