{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:41:52Z","timestamp":1725565312487},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220602"},{"type":"electronic","value":"9783540247685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24768-5_11","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:14:08Z","timestamp":1284167648000},"page":"97-105","source":"Crossref","is-referenced-by-count":0,"title":["Design and Experiment of a Communication-Aware Parallel Quicksort with Weighted Partition of Processors"],"prefix":"10.1007","author":[{"given":"Sangman","family":"Moh","sequence":"first","affiliation":[]},{"given":"Chansu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Dongsoo","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1994","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1994)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C.A.R. Hoare","year":"1962","unstructured":"Hoare, C.A.R.: Quicksort. Computer Journal\u00a05, 10\u201315 (1962)","journal-title":"Computer Journal"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1145\/3341.3348","volume":"28","author":"R.L. Wainwright","year":"1985","unstructured":"Wainwright, R.L.: A Class of Sorting Algorithms Based on Quicksort. Comm. of ACM\u00a028, 396\u2013402 (1985)","journal-title":"Comm. of ACM"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Leighton, F.T.: Tight Bounds on the Complexity of Parallel Sorting. In: Proc. 16th Annual ACM Symp. on Theory of Computing, New York, pp. 71\u201380 (1984)","DOI":"10.1145\/800057.808667"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Komlos, J., Szemeredi, E.: An O(n log n) Sorting Network. In: Proc. 15th Annual SCM Symp. on Theory of Computing, Boston, Massachusetts, pp. 1\u20139 (1983)","DOI":"10.1145\/800061.808726"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/2514.2516","volume":"16","author":"D. Bitton","year":"1984","unstructured":"Bitton, D., DeWitt, D.J., Hsiao, D.K., Menon, J.: A Taxonomy of Parallel Sorting. Computing Surveys\u00a016, 287\u2013318 (1984)","journal-title":"Computing Surveys"},{"key":"11_CR7","volume-title":"Parallel Sorting Algorithms","author":"S. Akl","year":"1985","unstructured":"Akl, S.: Parallel Sorting Algorithms. Academic Press, New York (1985)"},{"key":"11_CR8","first-page":"267","volume-title":"Sorting Algorithms, Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers","author":"B. Wilkinson","year":"1999","unstructured":"Wilkinson, B., Allen, M.: Sorting Algorithms, Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers, pp. 267\u2013297. Prentice-Hall, Upper Saddle River (1999)"},{"key":"11_CR9","volume-title":"Parallel Computing Works","author":"G.C. Fox","year":"1994","unstructured":"Fox, G.C., Williams, R.D., Messina, P.C.: Parallel Computing Works. Morgan Kaufmann, San Francisco (1994)"},{"key":"11_CR10","volume-title":"Parallel Computing: Theory and Practice","author":"M.J. Quinn","year":"1994","unstructured":"Quinn, M.J.: Parallel Computing: Theory and Practice, 2nd edn. McGraw-Hill, New York (1994)","edition":"2"},{"key":"11_CR11","unstructured":"Jelenkovic, L., Omecen-Ceko, G.: Experiments with Multithreading in Parallel Computing. In: Proc. 19 Int. Conf. on Information Technology Intercafes, Pula, Croatia, pp. 357\u2013362 (1997)"},{"key":"11_CR12","unstructured":"Beyer, D.A.: Memory Optimization for a Parallel Sorting Hardware Architecture, Thesis of MS, Electrical and Computer Engineering, Oregon State University (1998)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24768-5_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:08:34Z","timestamp":1620011314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24768-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220602","9783540247685"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24768-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}