Efficient array partitioning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 616-626

  Khanna, Sanjeev ^a   Muthukrishnan, S ^a   Skiena, Steven ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; AUTOMATA THEORY; BALANCING; IMAGE COMPRESSION; MOTION ESTIMATION; POLYNOMIAL APPROXIMATION;

BEST APPROXIMATIONS; DATA PARTITIONING; MINIMIZING THE NUMBER OF; NATURAL GENERALIZATION; PARALLEL LANGUAGES; PARALLEL MACHINE; POLYNOMIAL-TIME ALGORITHMS; TWO-DIMENSIONAL ARRAYS;

DATA HANDLING;

EID: 84950971965     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_216     Document Type: Conference Paper

References (18)

1. S. Anily and A. Federgruen. Structured partitioning problems. Operations Research, 13, 130-149, 1991.
2. S. Bokhari. Partitioning problems in parallel, pipelined, and distributed computing. IEEE Transactions on Computers, 37, 38-57, 1988.
3. B. Chapman, P. Mehrotra, and H. Zima. High performance Fortran languages: Advanced applications and their implementation. Future Generation Computer Systems, 401-407, 1995.
4. M. Charikar, C. Chekuri, and R. Motwani. Personal Communication, 1996.
5. H.-A. Choi and B. Narahari. Algorithms for mapping and partitioning chain structured parallel computations. Proc. Intl. Conf. on Parallel Processing, Vol 1, 625-628, 1991.
6. High Performance Fortran Forum Home Page. http://www.crpc.rice.edu/HPFF/home.html.
7. M. Grigni and F. Manne. On the complexity of the generalized block distribution. Proc. of 3rd international workshop on parallel algorithms for irregularly structured problems (IRREGULAR “96), Lecture notes in computer science 1117, Springer, 319-326, 1996.
8. Y. Han, B. Narahari and H.-A. Choi. Mapping a chain task to chained processors. Information Processing Letters 44, 141-148, 1992.
9. M. Halldorsson and F. Manne. Manuscript, 1996.
10. P. Hansen and K. Liu, Improved algorithms for Partitioning problems in parallel, pipeHned, and distributed computing. IEEE Trans. Computers, 41, 769-771, 1992.
11. M. Kaddoura, S. Ranka and A. Wang. Array decomposition for nonuniform computational environments. Technical Report, Syracuse University, 1995.
12. F. Manne. Load Balancing in Parallel Sparse Matrix Computations. Ph.d. thesis, Department of Informatics, University of Bergen, Norway, 1993.
13. I. Rhee, G. Martin, S. Muthukrishnan, and R. Packwood. Fast algorithms for variable size block matching motion estimation with minimal error. Manuscript, 1996.
14. F. Manne and T. Sorevik. Optimal partitioning of sequences. Journal of Algorithms, 19, 235-249, 1995.
15. F. Manne and T. Sorevik. Partitioning an array onto a mesh of processors. Proc. of Workshop on Applied Parallel Computing in Industrial Problems. 1996.
16. D. Nicol. Rectilinear partitioning of irregular data parallel computations. ICASE Report 91-55, 1991. J. Parallel and Distributed Computing, 23, 119-134, 1994.
17. B. Olstad and F. Manne. Efficient partitioning of sequences. IEEE Transactions on Computers, 44, 1322-1325, 1995.
18. H. Zima, H. Bast and M. Gerndt. Superb: A tool for semi-automatic MIMD/AIMD parallelization. Parallel Computing, 1-18, 1986.