@inproceedings{2a1214bbd4ca40e287a2644b0b3b2921,
title = "Parallel solution algorithms for the triangular sylvester equation",
abstract = "The parallelization problem can be divided into three main stages: identification of parallelism which includes dependency analysis, partitioning the statements into atomic tasks of granularity suitable to the target architecture and scheduling these tasks into the processors. An MIMD coarse grained parallel algorithm is developed for the triangular Sylvester equation. We compare well known scheduling heuristics such as the naive and compute-ahead with the N-cp/misf methods which are described here. These methods trade off time and space according to the value of the parameter N . Our conclusion is that the N-cp/misf methods are faster than compute-ahead.",
author = "A. Gerasoulis and I. Nelken",
year = "1990",
month = jan,
day = "1",
doi = "https://doi.org/10.1109/DMCC.1990.555397",
language = "English (US)",
series = "Proceedings of the 5th Distributed Memory Computing Conference, DMCC 1990",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "291--300",
editor = "Walker, {David W.} and Stout, {Quentin F.}",
booktitle = "Applications",
address = "United States",
note = "5th Distributed Memory Computing Conference, DMCC 1990 ; Conference date: 08-04-1990 Through 12-04-1990",
}