NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
Evaluation of non-cubic processor allocation in hybercubes
|dc.description||Due to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to firstname.lastname@example.org, referencing the URI of the item.||en|
|dc.description||Includes bibliographical references: p. 64-67.||en|
|dc.description||Issued also on microfiche from Lange Micrographics.||en|
|dc.description.abstract||The main objective of processor allocation and task mapping in Hypercube multicomputers is to maximize utilization by reducing external and internal fragmentation and to reduce the communication time for messages being exchanged between the processors. Whereas, cubic and contiguous allocation of processors in Hypercube has been well studied, non-cubic and non-contiguous allocations have been largely neglected because of potential message-contention and larger number of hops between source and destination nodes of a message. With current communication techniques, like wormhole routing, delay due to the number of hops between processors is known to be negligible. The goal of this thesis is to evaluate non-contiguous cubic and random allocation and task mapping in Hypercube computers. The degradation in performance due to message-contention and larger average number of hops for messages because of non-contiguity is studied. Emulation experiments are conducted with a synthetic application as well as some actual applications loaded in non-contiguous cubic and random fashion on a 32 node subcube of a Ncube system. The communication time for these applications are measured under varying amount of system load and with varying message sizes. The effects of link contention due to intertask and intratask message interference on the communication time of these applications are observed. It is shown that the increase in communication time of message-passing applications on Ncube due to non-contiguous cubic and random allocation is much smaller compared to a drastic improvement expected in system utilization and simplified task mapping in Hypercube systems. Hence, non-contiguous cubic and random processor allocation and topology independent task assignment can be used in Hypercubes.||en|
|dc.publisher||Texas A&M University|
|dc.rights||This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use.||en|
|dc.subject||Major computer science.||en|
|dc.title||Evaluation of non-cubic processor allocation in hybercubes||en|
Files in this item
This item appears in the following Collection(s)
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.