{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T11:57:15Z","timestamp":1723031835565},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,9,26]],"date-time":"2013-09-26T00:00:00Z","timestamp":1380153600000},"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":[[2014,4]]},"DOI":"10.1007\/s11227-013-1022-8","type":"journal-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T19:51:49Z","timestamp":1380138709000},"page":"49-64","source":"Crossref","is-referenced-by-count":4,"title":["A new parallel algorithm for vertex priorities of data flow acyclic digraphs"],"prefix":"10.1007","volume":"68","author":[{"given":"Zeyao","family":"Mo","sequence":"first","affiliation":[]},{"given":"Aiqing","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,26]]},"reference":[{"key":"1022_CR1","first-page":"113","volume-title":"Advances in project scheduling","author":"R Alvarez-Vald\u00e9s","year":"1989","unstructured":"Alvarez-Vald\u00e9s R, Tamarit JM (1989) Heuristic algorithms for resource-constrained project scheduling: a review and an empirical analysis. In: Advances in project scheduling. Elsevier, Amsterdam, pp 113\u2013134"},{"key":"1022_CR2","doi-asserted-by":"crossref","first-page":"312","DOI":"10.13182\/NSE98-1","volume":"128","author":"RS Baker","year":"1998","unstructured":"Baker RS, Koch KR (1998) An S n algorithm for the massively parallel CM-200 computer. Nucl Sci Eng 128:312\u2013320","journal-title":"Nucl Sci Eng"},{"key":"1022_CR3","unstructured":"Bosilca G, Bouteiller A, Danalis A, Herault T, Lemarinier P, Dongarra J (2010) GAGuE: a generic distributed DAG engine for high performance computing. Innovative Computing Laboratory. Technical Report, ICL-UT-10-01, April\u00a011"},{"issue":"1","key":"1022_CR4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0168-9274(96)00067-0","volume":"23","author":"J Bey","year":"1997","unstructured":"Bey J, Downwind GW (1997) Numbering: a robust multigrid method for convection diffusion problems on unstructured grids. Appl Numer Math 23(1):177\u2013192","journal-title":"Appl Numer Math"},{"key":"1022_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-2217(90)90116-S","volume":"49","author":"F Boctor","year":"1990","unstructured":"Boctor F (1990) Some efficient multi-heuristic procedures for resource-constrained project scheduling. Eur J Oper Res 49:3\u201313","journal-title":"Eur J Oper Res"},{"issue":"11","key":"1022_CR6","doi-asserted-by":"crossref","first-page":"1186","DOI":"10.1287\/mnsc.22.11.1186","volume":"22","author":"D Cooper","year":"1976","unstructured":"Cooper D (1976) Heuristics for scheduling resource-constrained projects: an experimental investigation. Manag Sci 22(11):1186\u20131194","journal-title":"Manag Sci"},{"key":"1022_CR7","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1287\/mnsc.21.8.944","volume":"21","author":"E Davis","year":"1975","unstructured":"Davis E, Patterson J (1975) A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Manag Sci 21:944\u2013955","journal-title":"Manag Sci"},{"issue":"12","key":"1022_CR8","doi-asserted-by":"crossref","first-page":"1590","DOI":"10.1287\/mnsc.37.12.1590","volume":"37","author":"A Drexl","year":"1991","unstructured":"Drexl A (1991) Scheduling of project networks by job assignment. Manag Sci 37(12):1590\u20131602","journal-title":"Manag Sci"},{"key":"1022_CR9","series-title":"Series: discrete mathematics and its applications","volume-title":"Handbook of graph theory","year":"2003","unstructured":"Gross JL, Yellen J (eds) (2003) Handbook of graph theory. Series: discrete mathematics and its applications, vol\u00a025. CRC Press, Boca Raton"},{"key":"1022_CR10","unstructured":"Gridgen (2012) User\u2019s manual for version 15. http:\/\/www.pointwise.com\/ gridgen"},{"key":"1022_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1002\/(SICI)1099-1506(199703\/04)4:2<85::AID-NLA100>3.0.CO;2-2","volume":"4","author":"W Hackbush","year":"1997","unstructured":"Hackbush W, Probst T (1997) Downwind Gauss\u2013Seidel smoothing for convection dominated problems. Numer Linear Algebra Appl 4:85\u2013102","journal-title":"Numer Linear Algebra Appl"},{"key":"1022_CR12","series-title":"Notes on numerical fluid mechanics","volume-title":"Incomplete decompositions (ILU)\u2014algorithms, theory and applications","year":"1993","unstructured":"Hackbush W, Wittum G (eds) (1993) Incomplete decompositions (ILU)\u2014algorithms, theory and applications. Notes on numerical fluid mechanics, vol\u00a041. Vieweg, Wiesbaden"},{"issue":"1","key":"1022_CR13","first-page":"57","volume":"10","author":"H Han","year":"1992","unstructured":"Han H, Ilin VP, Kellogg RB, Yuan W (1992) Analysis of flow directed iterations. J Comput Math 10(1):57\u201376","journal-title":"J Comput Math"},{"key":"1022_CR14","doi-asserted-by":"crossref","unstructured":"Hendrickson B, Leland R (1994) The Chaco user\u2019s guide: version 2.0. Technical Report, SAND94-2692, Sandia National Laboratories, Albuquerque, NM","DOI":"10.2172\/10106339"},{"key":"1022_CR15","first-page":"147","volume-title":"Project scheduling\u2014recent models, algorithms and applications","author":"R Kolisch","year":"1999","unstructured":"Kolisch R, Hartmann S (1999) Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. In: Weglarz J (ed) Project scheduling\u2014recent models, algorithms and applications. Kluwer Academic, Boston, pp 147\u2013178"},{"issue":"1","key":"1022_CR16","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R Kolisch","year":"2006","unstructured":"Kolisch R, Hartmann E (2006) Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur J Oper Res 174(1):23\u201337","journal-title":"Eur J Oper Res"},{"key":"1022_CR17","series-title":"Physica","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-50296-5","volume-title":"Project scheduling under resource constraints\u2014efficient heuristics for several problem classes","author":"R Kolisch","year":"1995","unstructured":"Kolisch R (1995) Project scheduling under resource constraints\u2014efficient heuristics for several problem classes. Physica. Springer, Heidelberg"},{"key":"1022_CR18","volume-title":"Digraphs: theory, algorithms and applications","author":"BJ J\u00f8rgen","year":"2001","unstructured":"J\u00f8rgen BJ, Gregory G (2001) Digraphs: theory, algorithms and applications. Springer, London"},{"key":"1022_CR19","first-page":"377","volume-title":"Proc joint intl conference on mathematics methods and supercomputing for nuclear applications","author":"KR Koch","year":"1997","unstructured":"Koch KR, Baker RS, Alcouffe RE, Baker RS, Alcouffe RE (1997) Parallel 3-d S n performance for MPI on cray-T3D. In: Proc joint intl conference on mathematics methods and supercomputing for nuclear applications, vol\u00a01, pp 377\u2013393"},{"key":"1022_CR20","volume-title":"Computational methods of neutron transport","author":"EE Lewis","year":"1984","unstructured":"Lewis EE, Miller WF (1984) Computational methods of neutron transport. Wiley, New York"},{"key":"1022_CR21","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/0377-2217(92)90320-9","volume":"56","author":"KY Li","year":"1992","unstructured":"Li KY, Willis RJ (1992) An iterative scheduling technique for resource-constrained project scheduling. Eur J Oper Res 56:370\u2013379","journal-title":"Eur J Oper Res"},{"key":"1022_CR22","volume-title":"Proceedings of the 3rd IEEE workshop on many-task computing on grids and supercomputers (MATAGS10)","author":"Q Meng","year":"2010","unstructured":"Meng Q, Luitjens J, Berzins M (2010) Dynamic task scheduling for the Uintah framework. In: Proceedings of the 3rd IEEE workshop on many-task computing on grids and supercomputers (MATAGS10)"},{"key":"1022_CR23","volume-title":"TeraGrid\u201911","author":"Q Meng","year":"2011","unstructured":"Meng Q, Berzins M, Schmidt J (2011) Using hybrid parallelism to improve memory use in the Uintah framework. In: TeraGrid\u201911, Solt Lake City, Utah, USA, 18\u201321\u00a0July"},{"key":"1022_CR24","volume-title":"Using MPI: portable parallel programming with the message-passing interface","author":"W Gropp","year":"1999","unstructured":"Gropp W, Lusk E, Skjellum A (1999) Using MPI: portable parallel programming with the message-passing interface, 2nd edn. MIT Press, Cambridge","edition":"2"},{"issue":"3","key":"1022_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2382585.2382586","volume":"39","author":"PK Notz","year":"2012","unstructured":"Notz PK, Pawlowski RP, Sutherland JC (2012) Graph-based software design for managing complexity and enabling concurrency in multiphysics PDE software. ACM Trans Math Software 39(3):1","journal-title":"ACM Trans Math Software"},{"issue":"3","key":"1022_CR26","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0272-6963(95)00015-1","volume":"14","author":"L Ozdamar","year":"1996","unstructured":"Ozdamar L, Ulusoy G (1996) An iterative local constraint based analysis for solving the resource constrained project scheduling problem. J Oper Manag 14(3):193\u2013208","journal-title":"J Oper Manag"},{"key":"1022_CR27","doi-asserted-by":"crossref","first-page":"111","DOI":"10.13182\/NSE02-1","volume":"140","author":"SD Pautz","year":"2002","unstructured":"Pautz SD (2002) An algorithm for parallel S n sweeps on unstructured meshes. Nucl Sci Eng 140:111\u2013136","journal-title":"Nucl Sci Eng"},{"key":"1022_CR28","doi-asserted-by":"crossref","first-page":"245","DOI":"10.13182\/NSE10-30","volume":"169","author":"SD Pautz","year":"2011","unstructured":"Pautz SD, Pandya T, Adams ML (2011) Scalable parallel prefix solvers for discrete ordinates transport. Nucl Sci Eng 169:245\u2013261","journal-title":"Nucl Sci Eng"},{"key":"1022_CR29","volume-title":"Proceeding of SuperComputing\u20192000","author":"S Plimpton","year":"2000","unstructured":"Plimpton S, Hendrickson B, Burns S, McLendon W (2000) Parallel algorithms for radiation transport on unstructured grids. In: Proceeding of SuperComputing\u20192000"},{"issue":"1","key":"1022_CR30","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1057\/palgrave.jors.2600318","volume":"48","author":"P Thomas","year":"1997","unstructured":"Thomas P, Salhi S (1997) An investigation into the relationship of heuristic performance with network-resource characteristics. J Oper Res Soc 48(1):34\u201343","journal-title":"J Oper Res Soc"},{"issue":"3","key":"1022_CR31","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/s02011-011-1137-8","volume":"26","author":"X Yang","year":"2011","unstructured":"Yang X, Liao X, Lu K, Hu Q, Song J, Su J (2011) The TianHe-1A supercomputer: its hardware and software. J Comput Sci Technol 26(3):344\u2013351","journal-title":"J Comput Sci Technol"},{"issue":"5","key":"1022_CR32","doi-asserted-by":"crossref","first-page":"3626","DOI":"10.1137\/050634554","volume":"31","author":"Z Mo","year":"2009","unstructured":"Mo Z, Zhang A, Wittum G (2009) Scalable heuristic algorithms for the parallel execution of data flow acyclic digraphs. SIAM J Sci Comput 31(5):3626\u20133642","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"1022_CR33","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/B:SUPE.0000032778.36178.d8","volume":"30","author":"Z Mo","year":"2004","unstructured":"Mo Z, Fu L (2004) Parallel flux sweep algorithm for neutron transport on unstructured grid. J Supercomput 30(1):5\u201317","journal-title":"J Supercomput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-1022-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-013-1022-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-1022-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T15:47:14Z","timestamp":1564069634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-013-1022-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,26]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["1022"],"URL":"https:\/\/doi.org\/10.1007\/s11227-013-1022-8","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,26]]}}}