Difference between revisions of "Publications:Analysis of Efficient TDMA Schedules via the Fat-Tree Network with Real-Time Many-to-Many Communication"
(Created page with "<div style='display: none'> == Do not edit this section == </div> {{PublicationSetupTemplate|Author=Bin Wang, Magnus Jonsson, Xing Fan |PID=237587 |Name=Wang, Bin [binwanx] (H...") |
(No difference)
|
Latest revision as of 04:43, 26 June 2014
[[Abstract::The Real-Time Many-to-Many (RTM2M) communication pattern is widely used in many parallel and distributed computing applications with time constraints such as radar signal processing. In this paper, we propose how to use TDMA (Time Division Multiple Access) to achieve efficient support for RTM2M over the fat-tree network built up on 4×2 switches (four children and two parents). Moreover, we have compared four different TDMA schedules in terms of the end-to-end delay and network utilization [1] and presented two of them in detail hereby. The general formulas of the end-to-end delay of two of the most interesting schedules are derived and simulations are represented to both verify the formulas and provide support for the conclusion from the viewpoint of the network utilization.
|]]| Title | Analysis of Efficient TDMA Schedules via the Fat-Tree Network with Real-Time Many-to-Many Communication |
|---|---|
| Author | Bin Wang and Magnus Jonsson and Xing Fan |
| Year | 2006 |
| PublicationType | Conference Paper |
| Journal | |
| HostPublication | Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks : as part of the 24th IASTED International Multi-Conference on Applied Informatics : February 14-16, 2006, Innsbruck, Austria |
| DOI | |
| Conference | 24th IASTED International Multi-Conference on Applied Informatics, February 14-16, 2006, Innsbruck, Austria |
| Diva url | http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:237587 |
| Abstract |
