Maximizing run time performance of deployed data flow graphs on a multiprocessor architecture

Richard J. Tobias; Peter D. Hunt

doi:10.1117/12.161444

20 October 1993 Maximizing run time performance of deployed data flow graphs on a multiprocessor architecture

Richard J. Tobias, Peter D. Hunt

Proceedings Volume 1957, Architecture, Hardware, and Forward-Looking Infrared Issues in Automatic Target Recognition; (1993) https://doi.org/10.1117/12.161444
Event: Optical Engineering and Photonics in Aerospace Sensing, 1993, Orlando, FL, United States

Abstract

This paper discusses a practical solution for supporting the deployment of data flow graphs onto the Loral/Rolm Computer Systems, Inc. vector processing multi-processor architecture. It outlines the support software (both workstation hosted and target system hosted) that is required to design, debug, and maximize deployed data flow graph performance on the multiprocessor architecture. The deployment process guarantees real-time deadlines, minimizes run time scheduling overhead, and minimizes designer partitioning input. It is known that determining effective run time data flow graph node schedules for multi-processor architectures is an NP-complete class of problem not well suited to real-time systems. Loral/Rolm Computer Systems, Inc.'s vector processing toolset recognizes this problem and this paper discusses a prescheduling and pre-assignment approach for partitioning data flow graphs to available hardware resources. In particular the toolset components (which are based upon an enhanced data flow graph language) of workstation pre-assignment, prescheduling, run time gross allocation and local compute element dispatching are discussed in detail.

Citation Download Citation

Richard J. Tobias and Peter D. Hunt "Maximizing run time performance of deployed data flow graphs on a multiprocessor architecture", Proc. SPIE 1957, Architecture, Hardware, and Forward-Looking Infrared Issues in Automatic Target Recognition, (20 October 1993); https://doi.org/10.1117/12.161444

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available