{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:17:10Z","timestamp":1725556630706},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131356"},{"type":"electronic","value":"9783642131363"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13136-3_40","type":"book-chapter","created":{"date-parts":[[2010,5,25]],"date-time":"2010-05-25T18:20:16Z","timestamp":1274811616000},"page":"391-400","source":"Crossref","is-referenced-by-count":0,"title":["Merging Data Records on EREW PRAM"],"prefix":"10.1007","author":[{"given":"Hazem M.","family":"Bahig","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","volume-title":"Parallel Sorting Algorithms","author":"S. Akl","year":"1985","unstructured":"Akl, S.: Parallel Sorting Algorithms. Academic Press Inc., London (1985)"},{"key":"40_CR2","volume-title":"Parallel Computation: Models and Methods","author":"S. Akl","year":"1997","unstructured":"Akl, S.: Parallel Computation: Models and Methods. Prentice Hall, Upper Saddle River (1997)"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TC.1987.5009478","volume":"36","author":"S. Akl","year":"1987","unstructured":"Akl, S., Santoro, N.: Optimal Parallel Merging and Sorting Without Memory Conflicts. IEEE Transactions on Computers\u00a036, 1367\u20131369 (1987)","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"40_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s11227-007-0141-5","volume":"43","author":"H. Bahig","year":"2008","unstructured":"Bahig, H.: Parallel Merging with Restriction. The Journal of Supercomputing\u00a043(1), 99\u2013104 (2008)","journal-title":"The Journal of Supercomputing"},{"issue":"1","key":"40_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.2316\/Journal.202.2008.1.202-2499","volume":"30","author":"H. Bahig","year":"2008","unstructured":"Bahig, H., Bahig, H.: Merging on PRAM. International Journal of Computers and Applications\u00a030(1), 51\u201355 (2008); Special Issue in High Performance Computing Architectures","journal-title":"International Journal of Computers and Applications"},{"issue":"4","key":"40_CR6","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.dam.2006.07.005","volume":"155","author":"J. Bang-Jensen","year":"2007","unstructured":"Bang-Jensen, J., Huang, J., Ibarra, L.: Recognizing and Representing Proper Interval Graphs in Parallel Using Merging and Sorting. Discrete Applied Mathematics\u00a0155(4), 442\u2013456 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"40_CR7","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1006\/inco.1993.1056","volume":"106","author":"O. Berkman","year":"1993","unstructured":"Berkman, O., Vishkin, U.: On Parallel Integer Merging. Information and Computation\u00a0106, 266\u2013285 (1993)","journal-title":"Information and Computation"},{"issue":"1","key":"40_CR8","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","volume":"30","author":"A. Borodin","year":"1985","unstructured":"Borodin, A., Hopcroft, J.: Routing, Merging, and Sorting on Parallel Models of Computation. Journal of Computer and System Science\u00a030(1), 130\u2013145 (1985)","journal-title":"Journal of Computer and System Science"},{"key":"40_CR9","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"issue":"2","key":"40_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(94)00009-3","volume":"50","author":"N. Deo","year":"1994","unstructured":"Deo, N., Jain, A., Medidi, M.: An Optimal Parallel Algorithm for Merging using Multiselection. Information Processing Letters\u00a050(2), 81\u201388 (1994)","journal-title":". Information Processing Letters"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0255(90)90021-2","volume":"51","author":"N. Deo","year":"1990","unstructured":"Deo, N., Sarak, D.: Parallel Algorithms for Merging and Sorting. Information Sciences\u00a051, 121\u2013131 (1990)","journal-title":"Information Sciences"},{"issue":"6","key":"40_CR12","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/S0167-8191(00)00104-6","volume":"27","author":"A. Gerbessiotis","year":"2001","unstructured":"Gerbessiotis, A., Siniolakis, C.: Merging on the BSP Model. Parallel Computing\u00a027(6), 809\u2013822 (2001)","journal-title":"Parallel Computing"},{"key":"40_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF02523238","volume":"17","author":"T. Hagerup","year":"1997","unstructured":"Hagerup, T., Kutylowski, M.: Fast Integer Merging on the EREW PRAM. Algorithmca\u00a017, 55\u201366 (1997)","journal-title":"Algorithmca"},{"issue":"4","key":"40_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(89)90138-5","volume":"33","author":"T. Hagerup","year":"1989","unstructured":"Hagerup, T., Rub, C.: Optimal Merging and Sorting on the EREW PRAM. Information Processing Letter\u00a033(4), 181\u2013185 (1989)","journal-title":"Information Processing Letter"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Karp, R., Ramachandran, V.: Parallel Algorithms for Shared-Memory Machines. In: Handbook of Theoretical Computer Science, vol.\u00a0A, pp. 870\u2013941 (1990)","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"issue":"4","key":"40_CR16","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/S0167-739X(03)00129-8","volume":"20","author":"C. Katsinis","year":"2004","unstructured":"Katsinis, C.: Merging, Sorting and Matrix Operations on the SOME-Bus Multiprocessor Architecture. Future Generation Computer Systems\u00a020(4), 643\u2013661 (2004)","journal-title":"Future Generation Computer Systems"},{"key":"40_CR17","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The Art of Computer Programming: Sorting and Searching. Addison-Wesley, Reading (1973)"},{"issue":"10","key":"40_CR18","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1109\/TC.1983.1676138","volume":"32","author":"C. Kruskal","year":"1983","unstructured":"Kruskal, C.: Searching, Merging, and Sorting in Parallel Computation. IEEE Transaction on Computers\u00a032(10), 942\u2013946 (1983)","journal-title":"IEEE Transaction on Computers"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"Kruskal, C., Rudolph, L., Snir, M.: A Complexity Theory of Efficient Parallel Algorithms. In: Handbook of Theoretical Computer Science, pp. 95\u2013132 (1990)","DOI":"10.1016\/0304-3975(90)90192-K"},{"issue":"4","key":"40_CR20","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/0306-4379(88)90007-5","volume":"13","author":"G. Liu","year":"1988","unstructured":"Liu, G., Chen, H.: Parallel Mering of Lists in Database Mangement System. Information Systems\u00a013(4), 423\u2013428 (1988)","journal-title":"Information Systems"},{"key":"40_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-75444-2_25","volume-title":"High Performance Computing and Communications","author":"W. Mach","year":"2007","unstructured":"Mach, W., Schikuta, E.: Parallel database sort and join operations revisited on grids. In: Perrott, R., Chapman, B.M., Subhlok, J., de Mello, R.F., Yang, L.T. (eds.) HPCC 2007. LNCS, vol.\u00a04782, pp. 216\u2013227. Springer, Heidelberg (2007)"},{"issue":"2","key":"40_CR22","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1137\/S0097539704446554","volume":"36","author":"Y. Matias","year":"2006","unstructured":"Matias, Y., Sega, E., Vitter, J.S.: Efficient Bundle Sorting. SIAM J. Computing\u00a036(2), 394\u2013410 (2006)","journal-title":"SIAM J. Computing"},{"key":"40_CR23","unstructured":"Merrett, T.: Relational Information Systems. Reston, Va. (1984)"},{"key":"40_CR24","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Shiloach, Y., Vishkin, U.: Finding the Maximum, Merging, and Sorting in a Parallel Computational Models. Journal of Algorithms\u00a02, 88\u2013102 (1981)","journal-title":"Journal of Algorithms"},{"key":"40_CR25","volume-title":"Proceedings of International Conference on High Performance Computing HPC ASIA\u201997","author":"D. Taniar","year":"1997","unstructured":"Taniar, D., Rahayu, W.: Parallel Double Sort-Merge Algorithm for Object-Oriented Collection Join Queries. In: Proceedings of International Conference on High Performance Computing HPC ASIA\u201997. IEEE Computer Society Press, Seoul (1997)"},{"key":"40_CR26","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/348.318590","volume":"9","author":"P. Valduriez","year":"1984","unstructured":"Valduriez, P., Gardarin, G.: Join and Semijoin Algorithms for Multiprocessors Database Machines. ACM Transaction Database Systems\u00a09, 133\u2013161 (1984)","journal-title":"ACM Transaction Database Systems"},{"key":"40_CR27","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0167-8191(90)90040-G","volume":"15","author":"P. Varman","year":"1990","unstructured":"Varman, P., Iyer, B., Haderle, B., Dunn, S.: Parallel Merging: Alogrithm and Implementation Results. Parallel Computing\u00a015, 165\u2013177 (1990)","journal-title":"Parallel Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13136-3_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:56:15Z","timestamp":1619769375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13136-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131356","9783642131363"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13136-3_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}