{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T06:01:54Z","timestamp":1649052114743},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,5,8]],"date-time":"2007-05-08T00:00:00Z","timestamp":1178582400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2008,1]]},"DOI":"10.1007\/s11227-007-0137-1","type":"journal-article","created":{"date-parts":[[2007,5,7]],"date-time":"2007-05-07T15:36:15Z","timestamp":1178552175000},"page":"43-58","source":"Crossref","is-referenced-by-count":2,"title":["Reconfigurable hardware solution to parallel prefix computation"],"prefix":"10.1007","volume":"43","author":[{"given":"Jin Hwan","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. K.","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,5,8]]},"reference":[{"key":"137_CR1","unstructured":"Agarwal RK (1992) Computational fluid dynamics on parallel processors, tutorial. McDonnell Douglas Research Laboratories. In: Proc of the 6th ACM SigArch int conference on supercomputing, Washington, DC, USA, July 1992"},{"key":"137_CR2","volume-title":"Parallel computation: models and methods","author":"SG Akl","year":"1997","unstructured":"Akl SG (1997) Parallel computation: models and methods. Prentice-Hall, New York"},{"key":"137_CR3","volume-title":"Highly parallel computing","author":"G Almasi","year":"1989","unstructured":"Almasi G, Gottlieb A (1989) Highly parallel computing. Benjamin\/Cummings, New York, Chapter 4"},{"key":"137_CR4","doi-asserted-by":"crossref","unstructured":"Beaumont-Smith A, Lim C (2001) Parallel prefix adder design. In: Proc of the 15th IEEE symposium on computer arithmetic, Vail, Colorado, USA, June 2001, pp\u00a0218\u2013225","DOI":"10.1109\/ARITH.2001.930122"},{"key":"137_CR5","doi-asserted-by":"crossref","unstructured":"Bilgory A, Gajski D (1986) A heuristic for suffix solutions. IEEE Trans Comput 35(1)","DOI":"10.1109\/TC.1986.1676655"},{"key":"137_CR6","first-page":"334","volume":"81","author":"R Cole","year":"1989","unstructured":"Cole R, Vishkin U (1989) Faster optimal parallel prefix sums and list ranking. Inf Control 81:334\u2013352","journal-title":"Inf Control"},{"key":"137_CR7","doi-asserted-by":"crossref","unstructured":"Court TV, Herbordt MC (2004) Families of FPGA-based algorithms for approximate string matching. In: Proc of the 15th IEEE int conference on application-specific systems, architectures and processors, pp\u00a0354\u2013364","DOI":"10.1109\/ASAP.2004.1342484"},{"key":"137_CR8","series-title":"Lecture notes in computer science","first-page":"337","volume-title":"Proceedings of LATIN 2006: theoretical informatics: 7th Latin American symposium","author":"HK Dai","year":"2006","unstructured":"Dai HK, Su HC (2006) A parallel algorithm for finding all successive minimal maximum subsequences. In: Proceedings of LATIN 2006: theoretical informatics: 7th Latin American symposium. Valdivia, Chile, March 2006. Lecture notes in computer science, vol 3887. Springer, New York, pp\u00a0337\u2013348"},{"issue":"2","key":"137_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TC.2005.26","volume":"54","author":"G Dimitrakopoulos","year":"2005","unstructured":"Dimitrakopoulos G, Nikolos D (2005) High-speed parallel-prefix VLSI ling adders. IEEE Trans Comput 54(2):225\u2013231","journal-title":"IEEE Trans Comput"},{"key":"137_CR10","doi-asserted-by":"crossref","unstructured":"Fich FE (1983) New bounds for parallel prefix circuits. In: Proc of the 15th annual ACM symposium on theory of computing, pp\u00a0100\u2013109","DOI":"10.1145\/800061.808738"},{"key":"137_CR11","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1109\/12.599897","volume":"46","author":"S Ha","year":"1997","unstructured":"Ha S, Lee EA (1997) Compile-time scheduling of dynamic constructs in dataflow program graphs. IEEE Trans Comput 46:768\u2013778","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"137_CR12","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1093\/comjnl\/47.3.329","volume":"47","author":"CN Hadjicostis","year":"2004","unstructured":"Hadjicostis CN (2004) Coding techniques for fault-tolerant parallel prefix computations in Abelian groups. Comput J 47(3):329\u2013341","journal-title":"Comput J"},{"key":"137_CR13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0020-0190(95)00119-W","volume":"56","author":"T Hagerup","year":"1995","unstructured":"Hagerup T (1995) The parallel complexity of integer prefix summation. Inf Process Lett 56:59\u201364","journal-title":"Inf Process Lett"},{"key":"137_CR14","doi-asserted-by":"crossref","unstructured":"Helman DR, Jaja J (1999) Prefix computations on symmetric multiprocessors. In: Proc of the 13th int parallel processing symp and 10th symp on parallel and distributed processing, San Juan, Puerto Rico, April 1999","DOI":"10.1109\/IPPS.1999.760427"},{"issue":"6","key":"137_CR15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0020-0190(02)00317-4","volume":"84","author":"PK Jana","year":"2002","unstructured":"Jana PK, Naidu BD et al.(2002) Parallel prefix computation on extended multimesh network. Inf Process Lett 84(6):295\u2013303","journal-title":"Inf Process Lett"},{"key":"137_CR16","volume-title":"Algorithms","author":"R Johnsonbaugh","year":"2004","unstructured":"Johnsonbaugh R, Schaefer M (2004) Algorithms. Pearson\/Prentice-Hall, New York"},{"key":"137_CR17","doi-asserted-by":"crossref","unstructured":"Kamakoti V, Balakrishnan N (1997) Efficient algorithms for prefix and general prefix computations on distributed shared memory systems with applications. In: Proc of the 1999 int conference on parallel and distributed systems, Seoul, Korea, Dec 1997, pp\u00a044\u201351","DOI":"10.1109\/ICPADS.1997.652528"},{"key":"137_CR18","unstructured":"Khan J, Rajagopalan J et al. (2004) A portable face recognition system using reconfigurable hardware. In: Proc of the 2004 int conference on engineering of reconfigurable systems and algorithms, Las Vegas, USA, June 2004"},{"issue":"4","key":"137_CR19","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R Ladner","year":"1980","unstructured":"Ladner R (1980) M Fischer. Parallel prefix computation, J Assoc Comput Mach 27(4):831\u2013838","journal-title":"Parallel prefix computation, J Assoc Comput Mach"},{"key":"137_CR20","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195088496.001.0001","volume-title":"Parallel computing using the prefix problem","author":"S Lakshmivarahan","year":"1994","unstructured":"Lakshmivarahan S, Dhall SK (1994) Parallel computing using the prefix problem. Oxford University Press, Oxford"},{"issue":"3","key":"137_CR21","first-page":"221","volume":"11","author":"Y-C Lin","year":"2003","unstructured":"Lin Y-C, Chen J-N (2003) Z4: A new depth-size optimal parallel prefix circuits with small depth. Neural Parallel Sci Comput 11(3):221\u2013236","journal-title":"Neural Parallel Sci Comput"},{"issue":"1","key":"137_CR22","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.jpdc.2003.09.004","volume":"64","author":"Y Lin","year":"2004","unstructured":"Lin Y, Hsiao J (2004) A new approach to constructing optimal parallel prefix circuits with small depth. J Parallel Distrib Comput 64(1):97\u2013107","journal-title":"J Parallel Distrib Comput"},{"key":"137_CR23","unstructured":"Lin YC, Lin CM (1996) Efficient parallel prefix algorithms on fully connected message passing computers. In: Proc of the 3rd int conference on high performance computing, Trivandrum, India, Dec 1996"},{"key":"137_CR24","volume-title":"Algorithms, sequential & parallel, a unified approach","author":"R Miller","year":"2000","unstructured":"Miller R, Boxer L (2000) Algorithms, sequential & parallel, a unified approach. Prentice-Hall, New York"},{"key":"137_CR25","doi-asserted-by":"crossref","unstructured":"Murty VS, Reghu Raj PC, Raman S (2003) Design of a high speed string matching co-processor for NLP. In: Proc of the 16th int conference on VLSI design, pp\u00a0183\u2013188","DOI":"10.1109\/ICVD.2003.1183134"},{"key":"137_CR26","volume-title":"Introduction to parallel processing: algorithms and architectures","author":"B Parhami","year":"2002","unstructured":"Parhami B (2002) Introduction to parallel processing: algorithms and architectures. Springer, Berlin"},{"key":"137_CR27","unstructured":"Park JH (2000) An efficient hardware algorithm for parallel prefix computation with resource constraints. In: Proc of the 2000 int conference on parallel & distributed processing tech and applications, Las Vegas, USA, June 2000"},{"key":"137_CR28","doi-asserted-by":"crossref","unstructured":"Park JH (2005) Reconfigurable parallel approximate string matching on FPGAs. In: Proc of the 8th EUROMICRO conference on digital system design, Porto, Portugal, Aug 2005, pp\u00a0214\u2013217","DOI":"10.1109\/DSD.2005.66"},{"key":"137_CR29","doi-asserted-by":"crossref","unstructured":"Park JH, George KM (1996) Parallel history sensitive computations in dataflow architecture. In: Proc of the IEEE second international conference on algorithms & architectures for parallel processing, Singapore, June 1996, pp\u00a0522\u2013529","DOI":"10.1109\/ICAPP.1996.562918"},{"key":"137_CR30","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1006\/jagm.1993.1019","volume":"14","author":"P Ragde","year":"1993","unstructured":"Ragde P (1993) The parallel simplicity of compaction and chaining. J Algorithms 14:371\u2013380","journal-title":"J Algorithms"},{"key":"137_CR31","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0218041","volume":"18","author":"S Rajasekaran","year":"1989","unstructured":"Rajasekaran S, Reif JH (1989) Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM J Comput 18:594\u2013607","journal-title":"SIAM J Comput"},{"key":"137_CR32","doi-asserted-by":"crossref","unstructured":"Roch J-L, Traore D, Bernard J (2006) On-line adaptive parallel prefix computation. In: Proc of the 12th int Europar conference, Dresden, Germany, Aug 2006","DOI":"10.1007\/11823285_88"},{"key":"137_CR33","unstructured":"Scrofano R, Prasanna VK (2004) Computing Lennard-Jones potentials and forces with reconfigurable hardware. In: Proc of the 2004 int conference on engineering of reconfigurable systems and algorithms, Las Vegas, USA, June 2004"},{"issue":"11","key":"137_CR34","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1109\/12.544482","volume":"45","author":"H Wang","year":"1996","unstructured":"Wang H, Nicolau A (1996) The strict time lower bound and optimal schedules for parallel prefix with resource constraints. IEEE Trans Comput 45(11):1257\u20131271","journal-title":"IEEE Trans Comput"},{"key":"137_CR35","unstructured":"Xilinx Inc, http:\/\/www.xilinx.com"},{"issue":"2","key":"137_CR36","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1145\/1142155.1142162","volume":"11","author":"H Zhu","year":"2006","unstructured":"Zhu H, Cheng C-K, Graham R (2006) On the construction of zero-deficiency parallel prefix circuits with minimum depth. ACM Trans Des Automat Electron Syst 11(2):387\u2013409","journal-title":"ACM Trans Des Automat Electron Syst"},{"key":"137_CR37","unstructured":"Zhuo L, Prasanna VK (2004) Scalable and modular algorithms for floating-point matrix multiplication on FPGAs. In: Proc of the 18th int parallel & distributed processing symposium, New Mexico, USA, April 2004"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-007-0137-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-007-0137-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-007-0137-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T05:14:39Z","timestamp":1628831679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-007-0137-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,8]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["137"],"URL":"https:\/\/doi.org\/10.1007\/s11227-007-0137-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,8]]}}}