Corrections to "Time Dependent Processing in a Parallel Pipeline Architecture"
JANUARY/FEBRUARY 2008 (Vol. 14, No. 1) p. 241
1077-2626/08/$31.00 © 2008 IEEE

Published by the IEEE Computer Society
Corrections to "Time Dependent Processing in a Parallel Pipeline Architecture"
John Biddiscombe

Berk Geveci

Ken Martin

Kenneth Moreland

David Thompson
  Article Contents  
  Introduction  
  REFERENCES  
Download Citation
   
Download Content
 
PDFs Require Adobe Acrobat
 
Introduction
In the article cited above, which appeared in the November/December 2007 issue (vol. 13, no. 6) of this journal, a portion of the text that appeared on p. 1379 was missing. The following is the text in its entirety:
shows that the algorithm objects do not directly communicate with each other, this allows two key operations:

    • The executives can insert additional time related metadata into the information stream. This data is used to provide the control mechanism that satisfies our time requests without affecting the algorithms themselves.

    • All traffic whether it be data or metadata, passing to or from an algorithm, is in fact passed from executive to executive via information objects before entering the algorithm. This allows an executive to change the data that is produced by one algorithm before passing it on to another. The executive uses this feature to collect data from multiple time steps before passing it on to a filter requiring temporal data.

4.3 Temporal Pipeline Extensions
We have enhanced the capabilities of the executives to recognize and act upon new information keys which have been introduced to support temporal data. The following key/value pairs have been defined in our pipeline.

    J. Biddiscombe is with the Swiss National Supercomputing Centre.

    E-mail: biddisco@cscs.ch.

    B. Geveci and K. Martin are with Kitware, Inc.

    E-mail: {berk.geveci, ken.martin}@kitware.com.

    K. Moreland and D. Thompson are with Sandia National Laboratories.

    E-mail: {kmorel, dcthomp}@sandia.gov.

Manuscript received 31 Mar. 2007; accepted 1 Aug. 2007; published online 27 Oct. 2007, published 14 Sept. 2007.

For information on obtaining reprints of this article, please send e-mail to: tpds@computer.org.

REFERENCES