Abstract
In large-scale distributed multiprocessor systems, communication delay becomes the bottleneck of system performance. A main factor which affects communication delay is the adopted routing method and the router design light traffic, the queuing delay can be increased drastically due to message congestion.
We have developed a hierarchical globally adaptive routing method. The method can poll global traffic status. According to the traffic status, it can select a routing path congestion which can alleviate. Therefore, the queuing delay due to congestion can be reduces significantly non-light traffic globally. We also developed two detail routing methods applied at different hierarchical routing levels¡Gthe look around routing method and the parallel approximate maze routing method. They can avoid selecting a routing path via congested regions as much as possible.
In this research, we designed a performance simulator of the globally adaptive mesh router. We also provided a traffic with the different levels of non-uniform traffic distribution. We utilized the performance simulator to exercise minimal routing, adaptive routing and our globally adaptive routing methods. The experiment results show that our globally adaptive method obtains significant performance improvement in non-light traffic.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0719100-034405 |
| Date | 19 July 2000 |
| Creators | Lin, Miao-Ying |
| Contributors | Li Lee, Jer-Min Jou, Tsung Lee |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0719100-034405 |
| Rights | unrestricted, Copyright information available at source archive |
Page generated in 0.0034 seconds