Task Allocation and Scheduling Models for Multiprocessor Digital Signal Processing

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 38, Issue 12, 1990, Pages 2151-2161

  Konstantinides, Konstantinos ^a   Kaneshiro, Ronald T ^a   Tani, Jon R ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS, DIGITAL--MULTIPROCESSING; SCHEDULING; SIGNAL PROCESSING--DIGITAL TECHNIQUES;

BRANCH AND BOUND ALGORITHM; SCHEDULING MODELS; TASK ALLOCATION;

COMPUTERS, DIGITAL;

EID: 0025629881     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/29.61542     Document Type: Article

References (27)

1. W. Zhao, K. Ramamritham, and J. A. Stankovic, “Scheduling tasks with resource requirements in hard real-time systems,” IEEE Trans. Software Eng., vol. SE-13, no. 5, pp. 564–577, May 1987.
2. J. A. Stankovic, K. Ramamritham, and S. Cheng, “Evaluation of a flexible task scheduling algorithm for distributed hard real-time system,” IEEE Trans. Comput., vol. C-34, no. 12, pp. 1130–1143, Dec. 1985.
3. H. Chang and M. Livny, “Distributed scheduling under deadline constraints: A comparison of sender-initiated and receiver-initiated approaches,” in Proc. IEEE Real-Time Syst. Symp., 1986, pp. 175–180.
4. W. W. Chu, L. J. Holloway, M. Lan, and K. Efe, “Task allocation in distributed data processing,” IEEE Comput. Mag., pp. 57–69, Nov. 1980.
5. J. Blazewicz and J. Weglarz, “Scheduling under resource constraints—achievements and prospects,” in Performance of Computer Systems, M. Arato, A. Butrimenko, and E. Gelenbe, Eds. Amsterdam: North-Holland, 1979.
6. B. Dasarathy and M. Feridun, “Task allocation problems in the synthesis of distributed real-time systems,” in Proc. IEEE Real-Time Syst. Symp., 1984, pp. 135–144.
7. E. A. Lee and D. G. Messerschmitt, “Synchronous data flow,” Proc. IEEE, vol. 75, no. 9, pp. 1235–1245, Sept. 1987.
8. E. A. Lee and D. G. Messerschmitt, “Static scheduling of synchronous data flow programs for digital signal processing,” IEEE Trans. Comput., vol. C-36, no. 2, pp. 24–35, Jan. 1987.
9. L. Sha, J. P. Lehoczky, and R. Rajkumar, “Solutions for some practical problems in prioritized preemptive scheduling,” in Proc. IEEE Real-Time Syst. Symp., 1986, pp. 181–191.
10. T. C. Hu, “Parallel sequencing and assembly line problems,” Oper. Res., vol. 9, no. 6, pp. 841–848, Nov.-Dec. 1961.
11. M. T. Kaufman, “An almost-optimum algorithm for the assembly line scheduling problem,” IEEE Trans. Comput., vol. C-23, no. 11, pp. 1169–1174, Nov. 1974.
12. W. H. Kohler, “A preliminary evaluation of the critical path method for scheduling tasks on multiprocessor systems,” IEEE Trans. Corn-put., pp. 1235–1238, Dec. 1975.
13. V. B. Gylys and J. A. Edwards, “Optimal partitioning of workload for distributed systems,” in Proc. COMPCON-76, pp. 353–357.
14. K. Efe, “Heuristic models of task assignment scheduling in distributed systems,” IEEE Comput. Mag., pp. 50–56, June 1982.
15. C. V. Ramamoorthy, K. M. Chandy, and M. J. Gonzalez, Jr., “Optimal scheduling strategies in a multiprocessor system,” IEEE Trans. Comput., vol. C-21, no. 2, Feb. 1972.
16. P. Markenscoff and W. Liaw, “Task allocation problems in distributed computer systems,” in IEEE Proc. Int. Conf. Parallel Processing, 1986, pp. 953–960.
17. P. R. Ma, E. Y. S. Lee, and M. Tsuchiya, “A task allocation model for distributed computing systems,” IEEE Trans. Comput., vol. C 31, no. 1, pp. 41–47, Jan. 1982.
18. J. Blazewicz, M. Drabowski, and J. Weglarz, “Scheduling multiprocessor tasks to minimize schedule length,” IEEE Trans. Comput., vol. C-35, no. 5, May 1986.
19. H. Muhlenbein, M. Gorges-Schleuter, and O. Kramer, “New solutions to the mapping problem of parallel systems: The evolution approach,” Parallel Computing, vol. 4, pp. 269–279, 1987.
20. M. A. Zissman and G. C. O’Leary, “A block diagram compiler for a digital signal processing MIMD computer,” in Proc. IEEE Int. Conf. ASSP (Dallas, TX), 1987, pp. 1867–1870.
21. Transputer Reference Manual, INMOS, 1986.
22. R. D. Fellman, R. T. Kaneshiro, and K. Konstantinides, “Design and evaluation of an architecture for a digital signal processor for instrumentation applications,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 38, no. 3, pp. 537–546, Mar. 1990.
23. E. G. Coffman, Jr., Ed., Computer and Job-Shop Scheduling Theory. New York: Wiley, 1976.
24. H. M. Salkin, Integer Programming. Reading, MA: Addison-Wesley, 1975.
25. R. S. Garfinkel and G. L. Nemhauser, Integer Programming. New York: Wiley, 1972.
26. A. M. Geoffrion, “Integer programming by implicit enumeration and Balas’ method,” SIAM Rev., vol. 9, no. 2, pp. 178–190, Apr. 1967.
27. N. Ph. Tuan, “A flexible tree-search method for integer programming problems,” Oper. Res., vol. 19, pp. 115–119, 1971.