@inproceedings{1be2efa0af7344ab935f1aa1ceb6051a,
title = "Scheduling partitioned algorithms on processor arrays with limited communication supports",
abstract = "It is important that array designs, especially the scheduling of partitioned arrays, must cope with various kinds of communication constraints such as interconnection topology, channel bandwidth, and inhomogeneous communication delay. The interprocessor communication requirements can be dictated by the dependence vectors and size of the partitioned tiles. A folded constraint graph is created to describe timing constraints between computation and communication events. An integer-programming based method can then be adopted to find an optimal execution schedule, including offset between the start times of processors, which satisfies these constraints.",
author = "Chou, {W. H.} and Kung, {S. Y.}",
note = "Publisher Copyright: {\textcopyright} 1993 IEEE.; 1993 International Conference on Application Specific Array Processors, ASAP 1993 ; Conference date: 25-10-1993 Through 27-10-1993",
year = "1993",
doi = "10.1109/ASAP.1993.397120",
language = "English (US)",
series = "Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "53--64",
editor = "Benjamin Wah and Luigi Dadda",
booktitle = "Proceedings of International Conference on Application Specific Array Processors, ASAP 1993",
address = "United States",
}