hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Fibre-ribbon ring network with inherent support for earliest deadline first message scheduling
Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).
Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).ORCID iD: 0000-0002-6526-3931
2002 (English)In: Proceedings: International Parallel and Distributed Processing Symposium : April 15-19, 2002, Ft. Lauderdale, Florida, USA, Los Alamitos, Calif.: IEEE , 2002, p. 157-163, article id 1016235Conference paper, Published paper (Refereed)
Abstract [en]

This paper presents a network with earliest deadline first (EDF) scheduling on a per slot basis. The network is called CCR-EDF (Control Channel based Ring network with EDF scheduling). The topology is a pipelined unidirectional fibre-ribbon ring that supports several simultaneous transmissions in non-overlapping segments and with dedicated fibres for clock and arbitration. In each slot the node that has highest priority generates the clock. The clock hand over strategy together with the scheduling feature gives the network the functionality for earliest deadline scheduling of periodic messages belonging to logical real-time connections. Logical realtime connections may be added and removed during runtime, through admission control. Guaranteed realtime communication service is supported to the user. Other services include best effort traffic and special services for parallel and distributed processing such as barrier synchronisation and global reduction.

Place, publisher, year, edition, pages
Los Alamitos, Calif.: IEEE , 2002. p. 157-163, article id 1016235
Keywords [en]
Fiber-optic communication, Real-time communication
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:hh:diva-2749DOI: 10.1109/IPDPS.2002.1016235Scopus ID: 2-s2.0-84966604780Local ID: 2082/3151ISBN: 0-7695-1573-8 (print)OAI: oai:DiVA.org:hh-2749DiVA, id: diva2:239967
Conference
International Parallel and Distributed Processing Symposium : April 15-19, 2002, Ft. Lauderdale, Florida, USA
Note

Copyright © 2002 IEEE. Reprinted from the IPDPS 2002 proceedings. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Halmstads's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Available from: 2009-08-12 Created: 2009-08-12 Last updated: 2018-02-09Bibliographically approved
In thesis
1. Protocols with Heterogeneous Real-Time Services for High-Performance Embedded Networks
Open this publication in new window or tab >>Protocols with Heterogeneous Real-Time Services for High-Performance Embedded Networks
2002 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Network protocols for applications that demand high performance and heterogeneous real-time services are presented. These protocols control the medium access to the network and offer additional features to the user, both different user services for traffic and services for parallel and distributed real-time processing. The network architecture assumed is a unidirectional pipelined optical ring.

Radar Signal Processing (RSP) is a typical application area. Such a system contains many computation nodes that are interconnected in order to co-operate and thereby achieve higher performance. The computing performance of the whole system is greatly affected by the choice of network. Computing nodes in a parallel computer for RSP should be tightly coupled, i.e., communications cost (e.g. latency) between nodes should be small, so that the whole system can be perceived as a single unit. This is possible if a suitable network with an efficient protocol is used.

There is an industrial need for new high-performance networks with support for the, often heterogeneous, real-time requirements found in (often embedded) applications such as RSP and other areas such as multimedia. The traffic this kind of network can be classified according to its requirements. The proposed protocols partition the traffic into three classes with distinctly different qualities. These classes are traffic with hard real-time demands, such as mission critical commands, traffic with soft real-time demands, such as process data (a deadline miss here only leads to decreased performance) and, finally, traffic with no real-time constraints at all. The contributions of the present thesis are protocols that integrate heterogeneous real-time services for the three traffic classes.

The performance of the proposed protocols is evaluated through simulations and analysis. It is shown that the protocol is an efficient choice for RSP systems. A brief survey of related technologies is included in the thesis. These are studied from the perspectives of application, architecture and user service.

Place, publisher, year, edition, pages
Göteborg: Chalmers tekniska högskola, 2002. p. x, 26
Series
Technical report. L ; 14
Keywords
Optical, Ring, Pipeline, Distributed, Parallel-Processing, Real-time, SAN, System Area Network, Heterogeneous, Service
Identifiers
urn:nbn:se:hh:diva-376 (URN)2082/700 (Local ID)2082/700 (Archive number)2082/700 (OAI)
Presentation
(English)
Available from: 2007-01-10 Created: 2007-01-10 Last updated: 2010-02-11Bibliographically approved

Open Access in DiVA

FULLTEXT01(476 kB)548 downloads
File information
File name FULLTEXT02.pdfFile size 476 kBChecksum SHA-512
631c8675af733826f8c2814dc1298332d6283b00a8d16415cc8284cdab32c1708654025f11626152744e907b2e9607b8aacbd50835970a224e0756451efbbf61
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records BETA

Jonsson, Magnus

Search in DiVA

By author/editor
Jonsson, Magnus
By organisation
School of Information Science, Computer and Electrical Engineering (IDE)
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 555 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 296 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf