SOS: Synthesis of application-specific heterogeneous multiprocessor systems

Journal of Parallel and Distributed Computing

Volumn 16, Issue 4, 1992, Pages 338-351

  Prakash, Shiv ^a   Parker, Alice C ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000679218     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-7315(92)90017-H     Document Type: Article

References (39)

1. A comparison of list schedules for parallel processing systems
2. Partitioning techniques for large-grained parallelism
3. Lower bound on the number of processors and time for scheduling precedence graphs with communication costs
4. A shortest tree algorithm for optimal assignments across space and time in a distributed processor system
5. Partitioning problems in parallel, pipelined, and distributed computing
6. Task allocation in distributed data processing
7. Task allocation and precedence relations for distributed real-time systems
8. Heuristic models of task assignment scheduling in distributed systems
9. Scheduling parallel program tasks onto arbitrary target machines
10. Bounds on the number of processors and time for multiprocessor optimal schedules
11. Parallelism detection and transformation techniques useful for VLSI algorithms
12. Superconcurrent processing, a dynamic approach to heterogeneous parallelism
13. Performance guarantees for scheduling algorithms
14. Analysis, modeling and optimization of multiprocessing execution time
15. Partitioned load allocation for minimum parallel processing time
16. Constraint improvements for MILP-based hardware synthesis
17. Bringing up Bozo
18. A formal method for the specification analysis and design of register-transfer level digital logic
19. Module allocation of real-time applications to distributed systems
20. Parallel sequencing and assembly line problems
21. A formal approach to the scheduling problem in high level synthesis
22. Scheduling precedence graphs in systems with interprocessor communication times
23. Optimal partitioning of randomly generated distributed programs
24. Practical multiprocessor scheduling algorithms for efficient parallel processing
25. On supercomputing with systolic/wavefront array processors
26. The design of optimal systolic arrays
27. A task allocation model for distributed computing systems
28. The high-level synthesis of digital systems
29. Task scheduling on multiprocessors
30. Spacetime representations of computational structures
31. Optimal partitioning of random programs across two processors
32. Unified System Construction (USC)
33. Guiding design decisions in RT-level logic synthesis
34. A mathematical programming model for synthesis of multiprocessor systems: Linearization, an example model, and some tradeoff studies
35. Assignment of tasks in a distributed processor system with limited memory
36. A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion
37. An overview of the PASM parallel processing system
38. Multiprocessor scheduling with the aid of network flow algorithms