DMCA
Managing Latency and Buffer Requirements in Processing Graph Chains (2001)
Cached
Download Links
- [www.cs.unc.edu]
- [www.cs.unc.edu]
- [www.cs.unc.edu]
- [cs.unc.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | The Computer Journal |
| Citations: | 10 - 1 self |
BibTeX
@ARTICLE{Goddard01managinglatency,
author = {Steve Goddard and Kevin Jeffay},
title = {Managing Latency and Buffer Requirements in Processing Graph Chains},
journal = {The Computer Journal},
year = {2001},
volume = {44},
pages = {200--1}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
this paper is organized as follows. Our results are related to other work in Section 2. Section 3 presents a brief overview of the portion of PGM used by the SAR graph, which is introduced in Section 4. Section 5 presents our execution model including node execution rates and a schedulability condition for EDF scheduling. Section 6 addresses latency management issues and Section 7 shows how to bound and manage the buffer requirements of an implementation of a graph. We summarize our contributions in Section 8
