{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T00:14:08Z","timestamp":1716855248601},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T00:00:00Z","timestamp":1713916800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100011033","name":"Agencia Estatal de Investigacion","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011033","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Logical and Algebraic Methods in Programming"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1016\/j.jlamp.2024.100966","type":"journal-article","created":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T15:36:41Z","timestamp":1713800201000},"page":"100966","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A computational framework based on the dynamic pipeline approach"],"prefix":"10.1016","volume":"139","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-8315-4977","authenticated-orcid":false,"given":"Edelmira","family":"Pasarella","sequence":"first","affiliation":[]},{"given":"Maria-Esther","family":"Vidal","sequence":"additional","affiliation":[]},{"given":"Cristina","family":"Zoltan","sequence":"additional","affiliation":[]},{"given":"Juan Pablo","family":"Royo Sales","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jlamp.2024.100966_br0010","series-title":"International Semantic Web Conference","first-page":"3","article-title":"Diefficiency metrics: measuring the continuous efficiency of query processing approaches","author":"Acosta","year":"2017"},{"issue":"8","key":"10.1016\/j.jlamp.2024.100966_br0020","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.3390\/electronics9081295","article-title":"The k-means algorithm: a comprehensive survey and performance evaluation","volume":"9","author":"Ahmed","year":"2020","journal-title":"Electronics"},{"issue":"4","key":"10.1016\/j.jlamp.2024.100966_br0030","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0012-365X(74)90076-4","article-title":"Partitions of multisets","volume":"9","author":"Bender","year":"1974","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.jlamp.2024.100966_br0040","first-page":"319","article-title":"The development of multiset theory","volume":"1","author":"Blizard","year":"1991","journal-title":"Mod. Log."},{"key":"10.1016\/j.jlamp.2024.100966_br0050","series-title":"2006 15th IEEE International Conference on High Performance Distributed Computing","first-page":"331","article-title":"Performance and practicability of dynamic adaptation for parallel computing","author":"Buisson","year":"2006"},{"issue":"1","key":"10.1016\/j.jlamp.2024.100966_br0060","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","article-title":"MapReduce: simplified data processing on large clusters","volume":"51","author":"Dean","year":"2008","journal-title":"Commun. ACM"},{"key":"10.1016\/j.jlamp.2024.100966_br0070","series-title":"Streaming Architecture: New Designs Using Apache Kafka and MapR Streams","author":"Dunning","year":"2016"},{"key":"10.1016\/j.jlamp.2024.100966_br0080","series-title":"Domain-Specific Languages","author":"Fowler","year":"2010"},{"key":"10.1016\/j.jlamp.2024.100966_br0090","series-title":"International Symposium on Logic-Based Program Synthesis and Transformation","first-page":"177","article-title":"Trace analysis using an event-driven interval temporal logic","author":"Gallardo","year":"2019"},{"issue":"9","key":"10.1016\/j.jlamp.2024.100966_br0100","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1002\/spe.2194","article-title":"Generic windowing support for extensible stream processing systems","volume":"44","author":"Gedik","year":"2014","journal-title":"Softw. Pract. Exp."},{"issue":"5","key":"10.1016\/j.jlamp.2024.100966_br0110","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/1168917.1168877","article-title":"Exploiting coarse-grained task, data, and pipeline parallelism in stream programs","volume":"40","author":"Gordon","year":"2006","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"key":"10.1016\/j.jlamp.2024.100966_br0120","series-title":"Handbook of Graph Theory","author":"Gross","year":"2003"},{"key":"10.1016\/j.jlamp.2024.100966_br0130","series-title":"Proceedings of the Tenth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","first-page":"48","article-title":"Composable memory transactions","author":"Harris","year":"2005"},{"issue":"12","key":"10.1016\/j.jlamp.2024.100966_br0140","doi-asserted-by":"crossref","first-page":"1805","DOI":"10.1109\/32.9065","article-title":"Dataflow computing models, languages, and machines for intelligence computations","volume":"14","author":"Herath","year":"1988","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10.1016\/j.jlamp.2024.100966_br0150","series-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism","article-title":"The formulae-as-types notion of construction","author":"Howard","year":"1980"},{"key":"10.1016\/j.jlamp.2024.100966_br0160","series-title":"Stream Processing with Apache Flink: Fundamentals, Implementation, and Operation of Streaming Applications","author":"Hueske","year":"2019"},{"key":"10.1016\/j.jlamp.2024.100966_br0170","series-title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017","first-page":"798","article-title":"Efficient massively parallel methods for dynamic programming","author":"Im","year":"2017"},{"key":"10.1016\/j.jlamp.2024.100966_br0180","series-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"938","article-title":"A Model of Computation for MapReduce","author":"Karloff","year":"2010"},{"key":"10.1016\/j.jlamp.2024.100966_br0190","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10723-017-9408-0","article-title":"Mapreduce and its applications, challenges, and architecture: a comprehensive review and directions for future research","volume":"15","author":"Khezr","year":"2017","journal-title":"J. Grid Comput."},{"key":"10.1016\/j.jlamp.2024.100966_br0200","unstructured":"B. Le Goff, P. Le Guernic, J. Araoz Durand, Semi-granules and schielding for off-line scheduling, Rapports de recherche- INRIA."},{"issue":"11","key":"10.1016\/j.jlamp.2024.100966_br0210","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1145\/361219.361222","article-title":"A genealogy of control structures","volume":"18","author":"Ledgard","year":"1975","journal-title":"Commun. ACM"},{"issue":"3","key":"10.1016\/j.jlamp.2024.100966_br0220","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2809808","article-title":"On-the-fly pipeline parallelism","volume":"2","author":"Lee","year":"2015","journal-title":"ACM Trans. Parallel Comput."},{"issue":"4","key":"10.1016\/j.jlamp.2024.100966_br0230","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/2094114.2094118","article-title":"Parallel data processing with mapreduce: a survey","volume":"40","author":"Lee","year":"2012","journal-title":"ACM SIGMOD Rec."},{"key":"10.1016\/j.jlamp.2024.100966_br0240","author":"Leskovec"},{"key":"10.1016\/j.jlamp.2024.100966_br0250","series-title":"Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data","first-page":"311","article-title":"Semantics and evaluation techniques for window aggregates in data streams","author":"Li","year":"2005"},{"key":"10.1016\/j.jlamp.2024.100966_br0260","author":"Haskell"},{"key":"10.1016\/j.jlamp.2024.100966_br0270","series-title":"CEFP 2011","first-page":"339","article-title":"Parallel and concurrent programming in Haskell","volume":"vol. 7241","author":"Marlow","year":"2012"},{"issue":"11","key":"10.1016\/j.jlamp.2024.100966_br0280","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/2088456.1863535","article-title":"Seq no more: better strategies for parallel Haskell","volume":"45","author":"Marlow","year":"2010","journal-title":"ACM SIGPLAN Not."},{"issue":"12","key":"10.1016\/j.jlamp.2024.100966_br0290","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/2096148.2034685","article-title":"A monad for deterministic parallelism","volume":"46","author":"Marlow","year":"2011","journal-title":"ACM SIGPLAN Not."},{"key":"10.1016\/j.jlamp.2024.100966_br0300","series-title":"2009 18th International Conference on Parallel Architectures and Compilation Techniques","first-page":"281","article-title":"Analytical modeling of pipeline parallelism","author":"Navarro","year":"2009"},{"key":"10.1016\/j.jlamp.2024.100966_br0310","series-title":"Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval","first-page":"2165","article-title":"Incremental pay-as-you-go fact checking with minimal user effort","author":"Nguyen","year":"2020"},{"key":"10.1016\/j.jlamp.2024.100966_br0320","doi-asserted-by":"crossref","first-page":"20","DOI":"10.4204\/EPTCS.237.2","article-title":"Comparing MapReduce and pipeline implementations for counting triangles","volume":"237","author":"Pasarella","year":"2017","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.jlamp.2024.100966_br0330","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3303849","article-title":"A comprehensive survey on parallelization and elasticity in stream processing","volume":"52","author":"R\u00f6ger","year":"2019","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.jlamp.2024.100966_br0340","series-title":"PROLE2021","article-title":"Towards a dynamic pipeline framework implemented in (parallel) Haskell","author":"Royo-Sales","year":"2021"},{"key":"10.1016\/j.jlamp.2024.100966_br0350","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0167-6423(85)90003-6","article-title":"The design of divide and conquer algorithms","volume":"5","author":"Smith","year":"1985","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/j.jlamp.2024.100966_br0360","series-title":"Structured Computer Organization","isbn-type":"print","author":"Tanenbaum","year":"2013","ISBN":"http:\/\/id.crossref.org\/isbn\/9780132916523"},{"key":"10.1016\/j.jlamp.2024.100966_br0370","series-title":"Databases Theory and Applications","first-page":"3","article-title":"knn join for dynamic high-dimensional data: a parallel approach","author":"Ukey","year":"2024"},{"issue":"8","key":"10.1016\/j.jlamp.2024.100966_br0380","doi-asserted-by":"crossref","first-page":"1845","DOI":"10.1109\/TPDS.2020.2978480","article-title":"Evaluation of stream processing frameworks","volume":"31","author":"Van Dongen","year":"2020","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"25","key":"10.1016\/j.jlamp.2024.100966_br0390","doi-asserted-by":"crossref","first-page":"1489","DOI":"10.1109\/TPDS.2013.125","article-title":"Hybrid dataflow\/von-neumann architectures","volume":"6","author":"Yazdanpanah","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.jlamp.2024.100966_br0400","series-title":"PROLE2019","article-title":"The dynamic pipeline paradigm","author":"Zoltan","year":"2019"}],"container-title":["Journal of Logical and Algebraic Methods in Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352220824000245?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352220824000245?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T07:53:20Z","timestamp":1716796400000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2352220824000245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":40,"alternative-id":["S2352220824000245"],"URL":"https:\/\/doi.org\/10.1016\/j.jlamp.2024.100966","relation":{},"ISSN":["2352-2208"],"issn-type":[{"value":"2352-2208","type":"print"}],"subject":[],"published":{"date-parts":[[2024,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A computational framework based on the dynamic pipeline approach","name":"articletitle","label":"Article Title"},{"value":"Journal of Logical and Algebraic Methods in Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jlamp.2024.100966","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 The Authors. Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"100966"}}