{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T16:28:16Z","timestamp":1771518496426,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540601173","type":"print"},{"value":"9783540494454","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60117-1_7","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:44:22Z","timestamp":1330278262000},"page":"97-127","source":"Crossref","is-referenced-by-count":11,"title":["Architecture independent massive parallelization of divide-and-conquer algorithms"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Achatz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfram","family":"Schulte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0096-0551(93)90036-Z","volume":"19","author":"T. Axford","year":"1993","unstructured":"T. Axford and M. Joy. List processing primitives for parallel computation. Computer Languages, 19(1):1\u201312, 1993.","journal-title":"Computer Languages"},{"key":"7_CR2","unstructured":"S. G. Akl. The Design and Analysis of Parallel Algorithms. Prentice-Hall, 1989."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"K. Achatz and W. Schulte. Architecture independent massive parallelization of devide-and-conquer algorithms. Technical Report 05-95, Universit\u00e4t Ulm, Fakult\u00e4t f\u00fcr Informatik, April 1995.","DOI":"10.1007\/3-540-60117-1_7"},{"key":"7_CR4","unstructured":"T. Axford. Crystal: The divide-and conquer paradigm as a basis for parallel language design. In L. Kronsjo and D. Shumsheruddin, editors, Advances in Parallel Algorithms, chapter 2. Blackwell, 1992."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"K. E. Batcher. Sorting networks and their applications. AFIPS Spring Joint Computer Conference, pages 307\u2013314, 1968.","DOI":"10.1145\/1468075.1468121"},{"key":"7_CR6","unstructured":"E. A. Boiten, A. M. Geerling, and H. A. Partsch. Transformational derivation of (parallel) programs using skeletons. Technical Report 93-20, Katholieke Universiteit Nijmegen, September 1993. Also: Proceedings of Computer Science in the Netherlands 1993, Utrecht."},{"key":"7_CR7","series-title":"NATO ASI Series. Series F: Computer and systems sciences 55","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/978-3-642-74884-4_5","volume-title":"Constructive methods in computing science","author":"R. Bird","year":"1989","unstructured":"R. Bird. Lectures on constructive functional programming. In M. Broy, editor, Constructive methods in computing science. NATO ASI Series. Series F: Computer and systems sciences 55, pages 151\u2013216, Berlin, 1989. Springer-Verlag."},{"key":"7_CR8","unstructured":"G. E. Blelloch. NESL: A nested data-parallel language (version 2.0). Technical Report CMU-CS-93-129, School of Computer Science, Carnegie Mellon University, April 1992."},{"key":"7_CR9","unstructured":"G. E. Blelloch. Prefix sums and their applications. In J Reif, editor, Synthesis of Parallel Algorithms, chapter 1, pages 35\u201360. Morgan Kaufmann Publishers, 1993."},{"key":"7_CR10","unstructured":"R. Bird and Ph. Wadler. An Introduction to Functional Programming. Prentice-Hall, 1988."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"M. Chen and Y. Choo. Domain morphisms: A new construct for parallel programming and formalizing program optimization. Technical Report DCS\/TR-817, Department of Computer Science, Yale University, August 1990.","DOI":"10.21236\/ADA249322"},{"issue":"10","key":"7_CR12","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/122616.122620","volume":"20","author":"B. Carpentieri","year":"1991","unstructured":"B. Carpentieri and G. Mou. Compile-time transformations and optimizations of parallel divide-and conquer algorithms. ACM SIGPLAN Notices, 20(10):19\u201328, 1991.","journal-title":"ACM SIGPLAN Notices"},{"key":"7_CR13","unstructured":"M. Cole. Algorithmic Skeletons: Structured Management of Parallel Computation. MIT Press, 1989."},{"key":"7_CR14","unstructured":"M. Cole. List homomorphic parallel algorithms for bracket matching. Technical Report CSR-29-93, Department of Computer Science, University of Edinburgh, August 1993."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"J. Darlington, A. Field, P. Harrison, P. Kelly, D. Sharp, Q. Wu, and R. White. Parallel programming using skeleton functions. In A. Bode, M. Reeve, and G. Wolf, editors, PARLE'93 Parallel Architectures and Languages Europe, volume 694 of Lecture Notes in Computer Science, pages 146\u2013160, 1993.","DOI":"10.1007\/3-540-56891-3_12"},{"key":"7_CR16","unstructured":"M. S. Feather. A survey and classification of some program transformation approaches and techniques. In L.G.L.T. Meertens, editor, Program Specification and Transformation. North-Holland, 1987."},{"issue":"1","key":"7_CR17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/cpe.4330010107","volume":"1","author":"G.C. Fox","year":"1989","unstructured":"G.C. Fox. Parallel computing comes of age: Supercomputer level parallel computations at caltech. Concurrency: Practice and Experience, 1(1):63\u2013103, 1989.","journal-title":"Concurrency: Practice and Experience"},{"key":"7_CR18","volume-title":"Technical Report DoC 92\/33","author":"A. M. Geerling","year":"1992","unstructured":"A. M. Geerling. Two examples of parallel-program derivation: Parallel-prefix and matrix multiplication. Technical Report DoC 92\/33, Imperial College London, November 1992."},{"key":"7_CR19","volume-title":"Technical Report CSI-R9324","author":"A. M. Geerling","year":"1993","unstructured":"A. M. Geerling. Formal derivation of SIMD parallelism from non-linear recursive specifications. Technical Report CSI-R9324, Katholieke Universiteit Nijmegen, September 1993."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"A.M. Geerling. Formal derivation of SIMD parallelism from non-linear recursive specifications. In B. Buchberger and J. Volkert, editors, CON-PAR'94 VAPP VI International Conference on Parallel and Vector Processing, pages 136\u2013147. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58430-7_13"},{"key":"7_CR21","unstructured":"S. Gorlatch and C. Lengauer. Parallelization of divide-and conquer in the Bird-Meertens formalism. Technical Report 12\/93, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, Dezember 1993."},{"key":"7_CR22","unstructured":"J. J\u00e1J\u00e1. An introduction to parallel algorithms. Addison-Wesley, 1992."},{"issue":"3","key":"7_CR23","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF00129780","volume":"2","author":"Z.G. Mou","year":"1988","unstructured":"Z.G. Mou and M. Hudak. An algebraic model for divide-and-conquer algorithms and its parallelism. Journal of Supercomputing, 2(3):257\u2013278, 1988.","journal-title":"Journal of Supercomputing"},{"issue":"1","key":"7_CR24","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TC.1979.1675216","volume":"27","author":"D. Nassimi","year":"1979","unstructured":"D. Nassimi and S. Sahni. Bitonic sort on a mesh-connected parallel computer. IEEE Transactions on Computers, 27(1):2\u20137, 1979.","journal-title":"IEEE Transactions on Computers"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"H. A. Partsch. Specification and Transformation of Programs. Springer-Verlag, 1990.","DOI":"10.1007\/978-3-642-61512-2"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"H. Partsch. Some experiments in transforming towards parallel executability. In R. Paige, J. Reif, and R. Wachter, editors, Parallel Algorithm Derivation and Program Transformation. Kluwer Academic Publisher, 1993.","DOI":"10.1007\/978-0-585-27330-3_3"},{"key":"7_CR27","unstructured":"P. Pepper. Deductive derivation of parallel programs. In R. Paige, J. Reif, and R. Wachter, editors, Parallel Algorithm Derivation and Program Transformation. Kluwer Academic Publishers, 1993. Also: Technical Report 92-23, Technische Universit\u00e4t Berlin, July 1992."},{"key":"7_CR28","first-page":"217","volume-title":"volume 735 of Lecture Notes in Computer Science","author":"P. Pepper","year":"1993","unstructured":"P. Pepper, J. Exner, and M. S\u00fcdholt. Functional development of massively parallel programs. In D. Bjorner, M. Broy, and I.V. Pottosin, editors, Formal Methods in Programming and Their Applications. Proceedings International Conference Novosibirsk, June\/July 1993, volume 735 of Lecture Notes in Computer Science, pages 217\u2013238, Berlin, 1993. Springer-Verlag."},{"key":"7_CR29","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1145\/359423.359430","volume":"20","author":"F. P. Preparata","year":"1977","unstructured":"F. P. Preparata and S. J. Hong. Convex hulls of finite sets of points in two and three dimensions. Communications of The ACM, 20:88\u201393, 1977.","journal-title":"Communications of The ACM"},{"key":"7_CR30","unstructured":"D.B. Skillicorn. A cost calculus for parallel functional programming. Technical Report ISSN-0836-0227-93-348, Department of Computing and Information Science, Queen's University, March 1993."},{"key":"7_CR31","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0167-6423(85)90003-6","volume":"5","author":"D.R. Smith","year":"1985","unstructured":"D.R. Smith. The design of divide-and-conquer algorithms. Science of Computer Programming, 5:37\u201358, 1985.","journal-title":"Science of Computer Programming"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"D. R. Smith. Derivation of paralel sorting algorithms. In R. Paige, J. Reif, and R. Wachter, editors, Parallel Algorithm Derivation and Program Transformation. Kluwer Academic Publisher, 1993.","DOI":"10.1007\/978-0-585-27330-3_2"},{"key":"7_CR33","unstructured":"J. A. Yang and Y. Choo. Data fields as parallel programs. Technical Report CT 06520-2158, Department of Computer Science, Yale University, March 1992."}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60117-1_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:55:09Z","timestamp":1605646509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60117-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601173","9783540494454"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-60117-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}