Precedence-constrained task allocation onto point-to-point networks for pipelined execution

IEEE Transactions on Parallel and Distributed Systems

Volumn 10, Issue 8, 1999, Pages 838-851

  Hary, Stephen L ^a,b   Özgüner, Füsun ^a,c  

^a IEEE

^b AIR FORCE RESEARCH LABORATORY   (United States)

^c Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COMPUTER SYSTEMS PROGRAMMING; CONSTRAINT THEORY; GRAPH THEORY; HEURISTIC METHODS; ITERATIVE METHODS; PIPELINE PROCESSING SYSTEMS; REAL TIME SYSTEMS;

POINT-TO-POINT NETWORKS;

PARALLEL PROCESSING SYSTEMS;

EID: 0033171346     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.790601     Document Type: Article

References (16)

1. C.-J. Hou and K. Shin, "Allocation of Periodic Task Modules with Precedence and Deadline Constraints in Distributed Real-Time Systems," Proc. IEEE Real-Time Systems Symp., pp. 146-155, 1992.
2. J. Jonsson and J. Vasell, "Real-Time Scheduling for Pipelined Execution of Data Flow Graphs on a Realistic Multiprocessor," Proc. Int'l Conf. Acoustics, Speech, and Signal Processing, pp. 3,314-3,317, May 1996.
3. K. Ramamritham, "Allocation and Scheduling of Precedence-Related Periodic Tasks," IEEE Trans. Parallel and Distributed Systems, vol. 6, pp. 412-420, Apr. 1995.
4. S.B. Shukla and D.P. Agrawal, "A Framework for Mapping Periodic Real-Time Applications on Multicomputers," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 7, pp. 778-784, July 1994.
5. T.-S. Tia and J.W.S. Liu, "Assigning Real-Time Tasks and Resources to Distributed Systems," Int'l J. Mini and Microcomputing, vol. 19, no. 1, pp. 18-25, 1995.
6. K. Tindell, A. Burns, and A. Wellings, "Allocating Hard Real-Time Tasks (An NP-Hard Problem Made Easy)," J. Real-Time Systems, vol. 4, pp. 145-165, 1992.
7. A. Burchard, J. Liebeherr, Y. Oh, and S.H. Son, "New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems," IEEE Trans. Computers, vol. 44, no. 12, pp. 1,429-1,442, Dec. 1995.
8. J.Y.T. Leung and J. Whitehead, "On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks," Performance Evaluation (Netherlands), vol. 2, pp. 237-250, 1982.
9. B.W. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs," Bell Systems Technical J., vol. 49, no. 2, pp. 291-307, 1970.
10. F. Ercal, J. Ramanujam, and P. Sadayappan, "Task Allocation onto a Hypercube by Recursive Mincut Bipartitioning," J. Parallel and Distributed Systems, vol. 10, pp. 35-44, 1990.
11. F. Pellegrini, "Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs," Proc. Scalable High-Performance Computing Conf., pp. 481-493, May 1994.
12. F. Pellegrini and J. Roman, "Experimental Analysis of the Dual Recursive Bipartitioning Algorithm for Static Mapping," Technical Report 1138-96, LaBRI Université Bordeaux, Sept. 1996.
13. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., 1979.
14. S.N. Bhatt, G. Bilardi, G. Pucci, A. Ranade, A.L. Rosenburg, and E.J. Schwabe, "On Bufferless Routing of Variable Length Messages in Leveled Networks," IEEE Trans. Computers, vol. 45, no. 6, pp. 714-729, June 1996.
15. S. Hary and F. Özgüner, "Real-Time Interprocessor Communication for Point-to-Point Networks Using Wormhole Routing," Workshop Parallel and Distributed Real-Time Systems (part of IPPS '96), pp. 157-163, Apr. 1996.
16. B.E. Wells and J. Neggers, "Analysis of a Random Digraph Generation Technique Used in the Evaluation of Parallel-Processing Static Task Allocation Heuristics," Proc. Southeastern Symp. Systems Theory, pp. 477-481, 1993.