PARAdeg-processor scheduling for acyclic SWITCH-less program nets

Journal of the Franklin Institute

Volumn 336, Issue 7, 1999, Pages 1135-1153

  Ge, Qi Wei ^a  

^a YAMAGUCHI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; DATA FLOW ANALYSIS; GENETIC ALGORITHMS; GRAPH THEORY; MULTIPROCESSING SYSTEMS; SCHEDULING;

DATA FLOW PROGRAM; EXTENDED CRITICAL PATH METHOD; LIST SCHEDULING; MULTIPROCESSOR SCHEDULING; PROGRAM NET;

PROGRAM PROCESSORS;

EID: 0033189336     PISSN: 00160032     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0016-0032(99)00026-5     Document Type: Article

References (23)

1. J.B. Dennis, First version of data flow procedure language. Lecture Notes in Computer Science, vol. 19G, Springer, New York, 1974.
2. J.B. Dennis, The MIT data flow engineering model, Proceedings of IFIP Congress 83, 1983, pp. 553-560.
3. Rumbaugh J. A data flow multiprocessor. IEEE Trans. Comput. c-26(2):1977;138-146.
4. Veen A.H. Dataflow machine architecture. ACM Comput. Survey. 18(4):1986;365-396.
5. Ge Q.W., Watanabe T., Onaga K. Topological analysis of firing activities of data-flow program pets. IEICE Trans. Fund. E73(7):1990;1215-1224.
6. Ge Q.W., Watanabe T., Onaga K. Execution termination and computation determinacy of data-flow program nets. J. Franklin Institute. 328(1):1991;123-141.
7. Yuba T. Dataflow parallel computers. J. System Control Inform. Japan. 33(5):1989;220-229.
8. Ge Q.W., Watanabe T., Onaga K. Analysis of parallelism in autonomous execution of data-flow program nets. IEICE Trans. Fund. E74(10):1991;3008-3017.
9. M.R. Garey, D.S. Johson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979.
10. E.G. Coffman, Computer and Job-Shop Scheduling Theory, Wiley, New York, 1976.
11. Lenstra J.K., Kan A.H.G.R. Complexity of scheduling under precedence constraints. Oper. Res. 26:1978;22-35.
12. Hu T.C. Parallel sequencing and assembly line problems. Oper. Res. 9:1961;841-848.
13. Coffman E.G., Graham R.L. Optimal scheduling for two-processors systems. Acta. Informatica. 1:1972;200-213.
14. T.E. Morton, D.W. Pentico, Heuristic Scheduling Systems, Wiley, New York, 1993.
15. T.L. Adam, K.M. Chandy, J.R. Dickson, A comparison of list scheduling for parallel processing systems, Commun. ACM 17 (12) (1974).
16. H. Kasahara, S. Narita, Practical multiprocessor scheduling algorithms for efficient parallel processing, IEEE Trans. Comput. c-33 (11) (1984).
17. Onaga K., Silva Manuel, Watanabe T. Qualitative analysis of periodic schedules for deterministically timed petri net systems. IEICE Trans. Fund. E76-A(4):1993;580-592.
18. Tanida T., Watanabe T., Yamauchi M., Onaga K. Priority-list scheduling in timed petri nets. ICIEC Trans. Fund. E75-A(10):1992;1394-1406.
19. Tamaki H. Combinatorial optimization by genetic algorithms. J. SICE. 34(5):1995;347-352.
20. Hou S.H., Ansari N., Ren H. A genetic algorithm for multiprocessor scheduling. IEEE Trans. Parallel Distrib. Systems. 5(2):1994;113-120.
21. Ge Q.W., Yanagida H. A method of computing minimum firing time for self-cleaning SWITCH-less program nets. J. Franklin Institute. 335B(5):1998;877-895.
22. J. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.
23. L. Davis, Handbook of Genetic Algorithms, Van Nostrand, 1990.