{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:56:05Z","timestamp":1743098165033,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":41,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493920914"},{"type":"electronic","value":"9781493920921"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-1-4939-2092-1_22","type":"book-chapter","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T09:30:47Z","timestamp":1426498247000},"page":"647-667","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Out-of-Core Task-based Middleware for Data-Intensive Scientific Computing"],"prefix":"10.1007","author":[{"given":"Erik","family":"Saule","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hasan Metin","family":"Aktulga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esmond G.","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00dcmit V.","family":"\u00c7ataly\u00fcrek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,17]]},"reference":[{"key":"22_CR1","first-page":"1","volume":"99","author":"P. Kogge","year":"2013","unstructured":"P. Kogge and J. Shalf, \u201cExascale computing trends: Adjusting to the new normal in computer architecture,\u201d Computing in Science Engineering, vol.\u00a0PP, no.\u00a099, pp.\u00a01\u20131, 2013.","journal-title":"Computing in Science Engineering"},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/MM.2012.3","volume":"32","author":"P. Ranganathan","year":"2012","unstructured":"P. Ranganathan and J. Chang, \u201c(Re)designing data-centric data centers,\u201d Micro, IEEE, vol.\u00a032, no.\u00a01, pp.\u00a066\u201370, 2012.","journal-title":"Micro, IEEE"},{"key":"22_CR3","unstructured":"E. Barragy, B. Brantley, S. Gurumurthi, M. Ignatowski, N. Jayasena, A. Lee, G. Loh, S. Manne, M. O\u2019Connor, P. Popescu, S. Reinhardt, and M. Schulte, \u201cAmd\u2019s fastforward extreme-scale computing processor and memory research,\u201d in US DOE Exascale Research Conference, Arlington, VA, USA, Oct. 2012."},{"key":"22_CR4","unstructured":"R. Nair, J. Moreno, and D. Joseph, \u201cAdvanced memory concepts for exascale systems,\u201d in US DOE Exascale Research Conference, Arlington, VA, USA, Oct. 2012."},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Y.-K. Kwok and I. Ahmad, \u201cStatic scheduling algorithms for allocating directed task graphs to multiprocessors,\u201d ACM Comput. Surv., vol.\u00a031, no.\u00a04, pp.\u00a0406\u2013471, Dec. 1999.","DOI":"10.1145\/344588.344618"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"C. Augonnet, S. Thibault, R. Namyst, and P.-A. Wacrenier, \u201cStarPU: A Unified Platform for Task Scheduling on Heterogeneous Multicore Architectures,\u201d Concurrency and Computation: Practice and Experience, Special Issue: Euro-Par 2009, vol.\u00a023, pp.\u00a0187\u2013198, Feb. 2011.","DOI":"10.1002\/cpe.1631"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"G. Bosilca, A. Bouteiller, A. Danalis, T. H\u00e9rault, P. Lemarinier, and J. Dongarra, \u201cDAGuE: A generic distributed DAG engine for high performance computing,\u201d Parallel Computing, vol.\u00a038, no.\u00a01\u20132, pp.\u00a037\u201351, 2012.","DOI":"10.1016\/j.parco.2011.10.003"},{"key":"22_CR8","unstructured":"G. Bosilca, M. Faverge, X. Lacoste, I. Yamazaki, and P. Ramet, \u201cToward a supernodal sparse direct solver over DAG runtimes,\u201d in Proceedings of PMAA'2012, London, UK, Jun. 2012."},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"A.-E. Hugo, A. Guermouche, R. Namyst, and P.-A. Wacrenier, \u201cComposing multiple StarPU applications over heterogeneous machines: a supervised approach,\u201d in Third International Workshop on Accelerators and Hybrid Exascale Systems, Boston, \u00c9tats-Unis, May 2013.","DOI":"10.1109\/IPDPSW.2013.217"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"C. Augonnet, O. Aumage, N. Furmento, R. Namyst, and S. Thibault, \u201cStarPU-MPI: Task Programming over Clusters of Machines Enhanced with Accelerators,\u201d in EuroMPI 2012, ser. LNCS, S. B. Jesper Larsson Tr\u00e4ff and J. Dongarra, Eds., vol.\u00a07490. Springer, Sep. 2012, poster Session.","DOI":"10.1007\/978-3-642-33518-1_40"},{"issue":"4","key":"22_CR11","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1142\/S0129626495000473","volume":"5","author":"M. Cosnard","year":"1995","unstructured":"M. Cosnard and M. Loi, \u201cAutomatic task graph genera tion techniques,\u201d Parallel Processing Letters, vol.\u00a05, no.\u00a04, p.\u00a0527\u2013538, 1995.","journal-title":"Parallel Processing Letters"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"M. Cosnard, E. Jeannot, and T. Yang, \u201cSlc: Symbolic scheduling for executing parameterized task graphs on multiprocessors,\u201d in Proc. ICPP, 1999.","DOI":"10.1007\/978-1-4757-3155-2_9"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"S. Toledo, \u201cA survey of out-of-core algorithms in numerical linear algebra,\u201d in External memory algorithms, J. M. Abello and J. S. Vitter, Eds. Boston, MA, USA: American Mathematical Society, 1999, pp.\u00a0161\u2013179.","DOI":"10.1090\/dimacs\/050\/09"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"J. K. Reid and J. A. Scott, \u201cAn out-of-core sparse cholesky solver,\u201d ACM Trans. Math. Softw., vol.\u00a036, no.\u00a02, 2009.","DOI":"10.1145\/1499096.1499098"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"V. Rotkin and S. Toledo, \u201cThe design and implementation of a new out-of-core sparse cholesky factorization method,\u201d ACM Trans. Math. Softw., vol.\u00a030, no.\u00a01, pp.\u00a019\u201346, 2004.","DOI":"10.1145\/974781.974783"},{"key":"22_CR16","unstructured":"P. R. Amestoy, I. S. Duff, Y. Robert, F.-H. Rouet, and B. Ucar, \u201cOn computing inverse entries of a sparse matrix in an out-of-core environment,\u201d CERFACS, Tech. Rep. TR\/PA\/10\/59, 2010."},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"J. A. Scott, \u201cScaling and pivoting in an out-of-core sparse direct solver,\u201d ACM Trans. Math. Softw., vol.\u00a037, no.\u00a02, 2010.","DOI":"10.1145\/1731022.1731029"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"E. Agullo, A. Guermouche, and J.-Y. L\u2019Excellent, \u201cA parallel out-of-core multifrontal method: Storage of factors on disk and analysis of models for an out-of-core active memory,\u201d Parallel Computing, Special Issue on Parallel Matrix Algorithms, no.\u00a06\u20138, 2008.","DOI":"10.1016\/j.parco.2008.03.007"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"E. Agullo, A. Guermouche, and J.-Y. L\u2019Excellent, \u201cReducing the I\/O Volume in Sparse Out-of-core Multifrontal Methods,\u201d SIAM Journal on Scientific Computing, no.\u00a06, 2010.","DOI":"10.1137\/080720061"},{"key":"22_CR20","unstructured":"W. J. Knottenbelt and P. G. Harrison, \u201cDistributed disk-based solution techniques for large markov models,\u201d in Proc. of Numerical Solution of Markov Chains, 1999."},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Y.-Y. Chen, Q. Gan, and T. Suel, \u201cLocal methods for estimating pagerank values,\u201d in Proceedings of the thirteenth ACM international conference on Information and knowledge management, ser. CIKM '04. New York, NY, USA: ACM, 2004, pp.\u00a0381\u2013389.","DOI":"10.1145\/1031171.1031248"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"E. Saule, P.-F. Dutot, and G. Mouni\u00e9, \u201cScheduling With Storage Constraints,\u201d in Proc of IPDPS'08, Apr. 2008, conference, acceptance rate: 25.6%.","DOI":"10.1109\/IPDPS.2008.4536292"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"S. S. Tse, \u201cOnline bicriteria load balancing using object reallocation,\u201d IEEE Transactions on Parallel and Distributed Systems, vol.\u00a020, no.\u00a03, pp.\u00a0379\u2013388, 2009.","DOI":"10.1109\/TPDS.2008.79"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"\u00dc. V. \u00c7ataly\u00fcrek, K. Kaya, and B. U\u00e7ar, \u201cIntegrated data placement and task assignment for scientific workflows in clouds,\u201d in The Fourth International Workshop on Data Intensive Distributed Computing (DIDC 2011), in conjunction with the 20th International Symposium on High Performance Distributed Computing (HPDC 2011), Jun 2011.","DOI":"10.1145\/1996014.1996022"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"R. Sethi, \u201cPebble games for studying storage sharing.\u201d Theor. Comput. Sci., vol.\u00a019, pp.\u00a069\u201384, 1982.","DOI":"10.1016\/0304-3975(82)90015-9"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"S. Biswas and S. Kannan, \u201cMinimizing space usage in evaluation of expression trees,\u201d in Foundations of Software Technology and Theoretical Computer Science, ser. Lecture Notes in Computer Science, P. Thiagarajan, Ed. Springer Berlin Heidelberg, 1995, vol.\u00a01026, pp.\u00a0377\u2013390.","DOI":"10.1007\/3-540-60692-0_62"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"C.-C. Lam, D. Cociorva, G. Baumgartner, and P. Sadayappan, \u201cMemory-optimal evaluation of expression trees involving large objects,\u201d in High Performance Computing \u2013 HiPC'99, ser. Lecture Notes in Computer Science, P. Banerjee, V. Prasanna, and B. Sinha, Eds. Springer Berlin Heidelberg, 1999, vol.\u00a01745, pp.\u00a0103\u2013110.","DOI":"10.1007\/978-3-540-46642-0_15"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"V. Rehn-Sonigo, D. Trystram, F. Wagner, H. Xu, and G. Zhang, \u201cOffline scheduling of multi-threaded request streams on a caching server,\u201d in IPDPS, 2011, pp.\u00a01167\u20131176.","DOI":"10.1109\/IPDPS.2011.111"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"M. Jacquelin, L. Marchal, Y. Robert, and B. U\u00e7ar, \u201cOn optimal tree traversals for sparse matrix factorization,\u201d in Parallel Distributed Processing Symposium (IPDPS), 2011 IEEE International, 2011, pp.\u00a0556\u2013567.","DOI":"10.1109\/IPDPS.2011.60"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"L. Marchal, O. Sinnen, and F. Vivien, \u201cScheduling tree-shaped task graphs to minimize memory and makespan,\u201d INRIA, Rapport de recherche RR-8082, Oct. 2012.","DOI":"10.1109\/IPDPS.2013.55"},{"key":"22_CR31","doi-asserted-by":"crossref","unstructured":"Z. Zhou, E. Saule, H. M. Aktulga, C. Yang, E. G. Ng, P. Maris, J. P. Vary, and \u00dc. V. \u00c7ataly\u00fcrek, \u201cAn out-of-core dataflow middleware to reduce the cost of large scale iterative solvers,\u201d in 2012 International Conference on Parallel Processing (ICPP) Workshops, Fifth International Workshop on Parallel Programming Models and Systems Software for High-End Computing (P2S2), Sep 2012.","DOI":"10.1109\/ICPPW.2012.13"},{"key":"22_CR32","doi-asserted-by":"crossref","unstructured":"M. D. Beynon, T. Kurc, \u00dc. V. \u00c7ataly\u00fcrek, C. Chang, A. Sussman, and J. Saltz, \u201cDistributed processing of very large datasets with DataCutter,\u201d Parallel Computing, vol.\u00a027, no.\u00a011, pp.\u00a01457\u20131478, Oct. 2001.","DOI":"10.1016\/S0167-8191(01)00099-0"},{"key":"22_CR33","doi-asserted-by":"crossref","unstructured":"Z. Zhou, E. Saule, H. M. Aktulga, C. Yang, E. G. Ng, P. Maris, J. P. Vary, and \u00dc. V. \u00c7ataly\u00fcrek, \u201cAn out-of-core eigensolver on SSD-equipped clusters,\u201d in Proc. of IEEE Cluster, Sep. 2012.","DOI":"10.1109\/CLUSTER.2012.76"},{"key":"22_CR34","doi-asserted-by":"crossref","unstructured":"J. Nieplocha, B. Palmer, V. Tipparaju, M. Krishnan, H. Trease, and E. Apra, \u201cAdvances, applications and performance of the global arrays shared memory programming toolkit,\u201d International Journal of High Performance Computing Applications, vol.\u00a020, pp.\u00a0203\u2013231, 2006.","DOI":"10.1177\/1094342006064503"},{"key":"22_CR35","doi-asserted-by":"crossref","unstructured":"P. Maris, H. M. Aktulga, M. A. Caprio, \u00dc. V. \u00c7ataly\u00fcrek, E. G. Ng, D. Oryspayev, H. Potter, E. Saule, M. Sosonkina, J. P. Vary et al., \u201cLarge-scale ab initio configuration interaction calculations for light nuclei,\u201d Journal of Physics: Conference Series, vol.\u00a0403, no.\u00a01, p.\u00a0012019, 2012.","DOI":"10.1088\/1742-6596\/403\/1\/012019"},{"key":"22_CR36","doi-asserted-by":"crossref","unstructured":"P. Maris, H. M. Aktulga, S. Binder, A. Calci, \u00dc. V. \u00c7ataly\u00fcrek, J. Langhammer, E. Ng, E. Saule, R. Roth, J. P. Vary, and C. Yang, \u201cNo-Core CI calculations for light nuclei with chiral 2- and 3-body forces,\u201d Journal of Physics: Conference Series, vol.\u00a0454, no.\u00a01, p.\u00a0012063, 2013.","DOI":"10.1088\/1742-6596\/454\/1\/012063"},{"key":"22_CR37","doi-asserted-by":"crossref","unstructured":"H. M. Aktulga, C. Yang, E. G. Ng, P. Maris, and J. P. Vary, \u201cImproving the scalability of a symmetric iterative eigensolver for multi-core platforms,\u201d Concurrency and Computation: Practice and Experience, p.\u00a0in press, 2013.","DOI":"10.1002\/cpe.3129"},{"key":"22_CR38","doi-asserted-by":"crossref","unstructured":"P. Sternberg, E. G. Ng, C. Yang, P. Maris, J. P. Vary, M. Sosonkina, and H. V. Le, \u201cAccelerating configuration interaction calculations for nuclear structure,\u201d in Proc. of SC08, 2008.","DOI":"10.1109\/SC.2008.5220090"},{"key":"22_CR39","doi-asserted-by":"crossref","unstructured":"A. V. Knyazev, \u201cToward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method,\u201d SIAM Journal on Scientific Computing, vol.\u00a023, no.\u00a02, pp.\u00a0517\u2013541, 2001.","DOI":"10.1137\/S1064827500366124"},{"key":"22_CR40","unstructured":"F. B. Schmuck and R. L. Haskin, \u201cGPFS: A shared-disk file system for large computing clusters,\u201d in Proc. of FAST'02, 2002, pp.\u00a0231\u2013244."},{"key":"22_CR41","doi-asserted-by":"crossref","unstructured":"M. Jung, E. H. W. III, W. Choi, J. Shalf, H. M. Aktulga, C. Yang, E. Saule, \u00dc. V. \u00c7ataly\u00fcrek, and M. Kandemir, \u201cExploring the future of out-of-core computing with compute-local non-volatile memory,\u201d in Proc. of Conference on High Performance Computing Networking, Storage and Analysis (SC '13), Nov 2013.","DOI":"10.1145\/2503210.2503261"}],"container-title":["Handbook on Data Centers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2092-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T22:39:20Z","timestamp":1676932760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4939-2092-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9781493920914","9781493920921"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2092-1_22","relation":{},"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}