Stream communication between real-time tasks in a high-performance multiprocessor

The demands in terms of processing performance, communication bandwidth and real-time throughput of many multimedia applications are much higher than today's processing architectures can deliver. The Prophid heterogeneous multiprocessor architecture template aims to bridge this gap. The templat...

Full description

Saved in:
Bibliographic Details
Published in:Design, automation, and test in Europe : proceedings, February 23-26, 1998, Paris, France pp. 125 - 131
Main Authors: Leijten, J. A. J., van Meerbergen, J. L., Timmer, A. H., Jess, J. A. G.
Format: Conference Proceeding
Language:English
Published: Washington, DC, USA IEEE Computer Society 23.02.1998
Series:ACM Conferences
Subjects:
ISBN:9780818683596, 0818683597
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The demands in terms of processing performance, communication bandwidth and real-time throughput of many multimedia applications are much higher than today's processing architectures can deliver. The Prophid heterogeneous multiprocessor architecture template aims to bridge this gap. The template contains a general purpose processor connected to a central bus, as well as several high-performance application domain specific processors. A high-throughput communication network is used to meet the high bandwidth requirements between these processors. In this network multiple time-division-multiplexed data streams are transferred over several parallel physical channels. This paper presents a method for guaranteeing the throughput for hard-real-time streams in such a network. At compile time sufficient bandwidth is assigned to these streams. The assignment can be determined in polynomial time. Remaining bandwidth is assigned to soft-real-time streams at run time. We thus achieve efficient stream communication with guaranteed performance.
Bibliography:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9780818683596
0818683597
DOI:10.5555/368058.368115