{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:19:17Z","timestamp":1740028757199,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008521"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-36569-9_27","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:05Z","timestamp":1269897125000},"page":"407-420","source":"Crossref","is-referenced-by-count":5,"title":["Mapping Unstructured Applications into Nested Parallelism Best Student Paper Award: First Prize"],"prefix":"10.1007","author":[{"given":"Arturo","family":"Gonz\u00e1lez-Escribano","sequence":"first","affiliation":[]},{"given":"Arjan J.C.","family":"Gemund","sequence":"additional","affiliation":[]},{"given":"Valent\u00edn","family":"Carde\u00f1oso-Payo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/280277.280278","volume":"30","author":"D. Skillicorn","year":"1998","unstructured":"Skillicorn, D., Talia, D.: Models and languages for parallel computation. ACM Computing Surveys 30 (1998) 123\u2013169 408","journal-title":"ACM Computing Surveys"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Vald\u00e9s","year":"1982","unstructured":"Vald\u00e9s, J., Tarjan, R., Lawler, E.: The recognition of series parallel digraphs. SIAM Journal of Computing 11 (1982) 298\u2013313 408, 411","journal-title":"SIAM Journal of Computing"},{"key":"27_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BFb0028590","volume-title":"Series-parallel posets: Algebra, automata, and languages","author":"K. Lodaya","year":"1998","unstructured":"Lodaya, K., Weil, P.: Series-parallel posets: Algebra, automata, and languages. In: Proc. STACS\u201998. Volume 1373 of LNCS., Paris, France, Springer (1998) 555\u2013565 408"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Gemund, A.v.: The importance of synchronization structure in parallel program optimization. In: Proc. 11th ACM ICS, Vienna (1997) 164\u2013171 408","DOI":"10.1145\/263580.263625"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1109\/TSE.1987.232852","volume":"13","author":"R. Sahner","year":"1987","unstructured":"Sahner, R., Trivedi, K.: Performance and reliability analysis using directed acyclic graphs. IEEE Trans. on Software Eng. 13 (1987) 1105\u20131114 408","journal-title":"IEEE Trans. on Software Eng."},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jpdc.1995.1089","volume":"28","author":"D. Skillicorn","year":"1995","unstructured":"Skillicorn, D.: A cost calculus for parallel functional programming. Journal of Parallel and Distributed Computing 28 (1995) 65\u201383 408","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Blumofe, R., Leiserson, C.: Scheduling multithreaded computations by work stealing. In: Proc. Annual Symposium on FoCS. (1994) 356\u2013368 408","DOI":"10.1109\/SFCS.1994.365680"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0304-3975(96)00035-7","volume":"162","author":"L. Finta","year":"1996","unstructured":"Finta, L., Liu, Z., Milis, I., Bampis, E.: Scheduling UET-UCT series-parallel graphs on two processors. Theoretical Computer Science 162 (1996) 323\u2013340 408","journal-title":"Theoretical Computer Science"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. Valiant","year":"1990","unstructured":"Valiant, L.: A bridging model for parallel computation. Comm.ACM 33 (1990) 103\u2013111 408","journal-title":"Comm.ACM"},{"key":"27_CR10","unstructured":"Kessler, C.: NestStep: nested parallelism and virtual shared memory for the BSP model. In: Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA\u201999), Las Vegas (USA) (1999) 408"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Bonorden, O., Juurlink, B., von Otte, I., Rieping, I.: The Paderborn University BSP (PUB) library-design, implementation, and performance. In: Proc. IPPS\/SPDP\u201999, San Juan, Puerto Rico, Computer Society, IEEE (1999) 408","DOI":"10.1109\/IPPS.1999.760442"},{"key":"27_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BFb0020455","volume-title":"Europar\u201995","author":"J. Darlington","year":"1995","unstructured":"Darlington, J., Guo, Y., To, H., Yang, J.: Functional skeletons for parallel coordination. In: Europar\u201995. LNCS (1995) 55\u201369 408"},{"key":"27_CR13","unstructured":"Cole, M.: Frame: an imperative coordination language for parallel programming. Technical Report EDI-INF-RR-0026, Division of Informatics, University of Edinburgh (2000) 408"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Blumofe, R., Joerg, C., Kuszmaul, B., Leiserson, C., Randall, K., Zhou, Y.: Cilk: An efficient multithreaded runtime system. In: Proc. of 5th PPoPP, ACM (1995) 207\u2013216 408","DOI":"10.1145\/209936.209958"},{"key":"27_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/3-540-44942-6_10","volume-title":"VECPAR 2000","author":"A. Gonz\u00e1lez-Escribano","year":"2000","unstructured":"Gonz\u00e1lez-Escribano, A., Gemund, A.v., Carde\u00f1oso-Payo, V., Alonso-L\u00f3pez, J., Mart\u00edn-Garc\u00eda, D., Pedrosa-Calvo, A.: Measuring the performance impact of SP-restricted programming in shared-memory machines. In J. M. L. M. Palma, J. Dongarra, V. H., ed.: VECPAR 2000. Number 1981 in LNCS, Porto (Portugal), Springer (2000) 128\u2013728 408, 410"},{"key":"27_CR16","unstructured":"Lin, H.: A general approach for parallelizing the FEM software package DIANA. In: Proc. High Performance Computing Conference\u201994, National Supercomputing Research Center. National University of Singapur (1994) 229\u2013236 409, 417"},{"key":"27_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/3-540-61142-8_585","volume-title":"Tgex: a tool for portable parallel and distributed execution of unstructured problems","author":"H. Lin","year":"1996","unstructured":"Lin, H., Gemund, A.v., Meijdam, J., Nauta, P.: Tgex: a tool for portable parallel and distributed execution of unstructured problems. Volume 1067 of LNCS., Berlin, Springer (1996) 467\u2013474 409, 417"},{"key":"27_CR18","unstructured":"Gonz\u00e1lez-Escribano, A., Gemund, A.v., Carde\u00f1oso, V.: Predicting the impact of implementation level aspects on parallel application performance. In: CPC\u20192001 Ninth Int. Workshop on Compilers for Parallel Computing, Edinburgh, Scotland UK (2001) 367\u2013374 410"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Gerbessiotis, A., Valiant, L.: Direct bulk-synchronous parallel algorithms. Technical Report TR-10-92, Center for Research in Computing Technology, Harvard University, Cambridge, Massachussets (1992) 410","DOI":"10.1007\/3-540-55706-7_1"},{"key":"27_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-58021-2_8","volume-title":"Comp. Perf. Eval.: Modelling Techniques and Tools","author":"A. Malony","year":"1994","unstructured":"Malony, A., Mertsiotakis, V., Quick, A.: Automatic scalability analysis of parallel programs based on modeling techniques. In Haring, G., Kotsis, G., eds.: Comp. Perf. Eval.: Modelling Techniques and Tools (LNCS 794), Berlin, Springer-Verlag (1994) 139\u2013158 410"},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1006\/jpdc.1994.1038","volume":"21","author":"G. Blelloch","year":"1994","unstructured":"Blelloch, G., Chatterjee, S., Hardwick, J., Sipelstein, J., Zagha, M.: Implementation of a portable nested data-parallel language. Journal of Parallel and Distributed Computing 21 (1994) 4\u201314 410","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"27_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BFb0057871","volume-title":"EuroPar\u201998","author":"C. Boeres","year":"1998","unstructured":"Boeres, C., Rebello, V., Skillicorn, D.: Static scheduling using task replication for LogP and BSP models. In: EuroPar\u201998. Volume 1480 of LNCS., Springer (1998) 337\u2013346 410"},{"key":"27_CR23","unstructured":"Munier, A., Hanen, C.: Using duplication for scheduling unitary tasks on m processors with unit communication delays. Technical Report LITP 95\/47, Laboratoire Informatique Th\u00e9orique et Programmation, Institut Blaise Pascal, Universit\u00e9 Pierre et Marie Curie, 4, place jussieu, 75252 Paris cedex 05 (1995) 410"},{"key":"27_CR24","unstructured":"Eisenbiegler, J., L\u00f3we, W., Wehrenpfennig, A.: On the optimization by redundancy using an extended LogP model. In: Proc. Advances in Parallel and Distributed Computing Conference (APDC\u201997), IEEE (1997) 410"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Bilardi, G., Herley, K., Pietracaprina, A.: BSP vs. LogP. In: Proc. 8th ACM symposium on Parallel algorithms and architectures (SPAA\u201996), Padua, Italy, ACM (1996) 25\u201332 410","DOI":"10.1145\/237502.237504"},{"key":"27_CR26","unstructured":"Ramachandran, V., Grayson, B., Dahlin, M.: Emulations between QSM, BSP and LogP: A framework for general-purpose parallel algorithm design. In: Proc. ACM-SIAM SODA\u201999. (1999) 957\u2013958 410"},{"key":"27_CR27","unstructured":"Gonz\u00e1lez-Escribano, A., Gemund, A.v., Carde\u00f1oso, V.: A new algorithm for mapping DAGs to series-parallel form. Technical Report IT-DI-2002-2, Dpto. Inform\u00e1tica, Univ. Valladolid (2002) 411, 413"},{"key":"27_CR28","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1137\/0221065","volume":"6","author":"W. Bein","year":"1992","unstructured":"Bein, W., Kamburowski, J., Stallman, F.: Optimal reductions of two-terminal directed acyclic graphs. SIAM Journal of Computing 6 (1992) 1112\u20131129 411","journal-title":"SIAM Journal of Computing"},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.: Dynamic algorithms for graphs with treewidth 2. In: Proc. Workshop on Graph-Theoretic Concepts in Computer Science. (1994) 413","DOI":"10.1007\/3-540-57899-4_45"},{"key":"27_CR30","unstructured":"Gonz\u00e1lez-Escribano, A., Carde\u00f1oso, V., Gemund, A.v.: On the loss of parallelism by imposing synchronization structure. In: Proc. 1st Euro-PDS Int\u2019l Conf. on Parallel and Distributed Systems, Barcelona (1997) 251\u2013256 415"},{"key":"27_CR31","unstructured":"Tobita, T., Kasahara, H.: A standard task graph set for fair evaluation of multiprocessor scheduling algorithms. In: ICS\u201999 Workshop. (1999) 71\u201377 416"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing for Computational Science \u2014 VECPAR 2002"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T19:12:20Z","timestamp":1739992340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36569-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540008521"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-36569-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}