Determining sampling rate for computational task graphs running under the macrodataflow model of execution

M A Maiza, T Clarke

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Sampling Rate (SR) for a Computational Task Graph (CTG) can be determined by analysing the frequency at which the task nodes can work, the asynchrony of the data input at the nodes and the length of the feedback loops. If a CTG is fed by input data faster than its SR capacity then, some loss of data will occur. In this paper we quantify the different data loss situations that may arise in a CTG and define an approach for determining an input data SR such that no data loss occurs.

Original languageEnglish
Title of host publicationICECS 96 - PROCEEDINGS OF THE THIRD IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS, AND SYSTEMS, VOLS 1 AND 2
Place of PublicationNEW YORK
PublisherIEEE
Pages671-675
Number of pages5
ISBN (Print)0-7803-3650-X
Publication statusPublished - 1996
Event3rd IEEE International Conference on Electronics, Circuits, and Systems (ICECS 96) - RHODES
Duration: 13 Oct 199616 Oct 1996

Conference

Conference3rd IEEE International Conference on Electronics, Circuits, and Systems (ICECS 96)
CityRHODES
Period13/10/9616/10/96

Keywords

  • task graphs
  • task precedence
  • scheduling
  • clustering
  • parallel processing
  • realtime systems

Cite this