{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T04:01:34Z","timestamp":1768536094682,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,2,12]],"date-time":"2013-02-12T00:00:00Z","timestamp":1360627200000},"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":[[2013,4]]},"DOI":"10.1007\/s11227-012-0845-z","type":"journal-article","created":{"date-parts":[[2013,2,11]],"date-time":"2013-02-11T07:05:55Z","timestamp":1360566355000},"page":"177-203","source":"Crossref","is-referenced-by-count":13,"title":["Task graph pre-scheduling, using Nash equilibrium in game theory"],"prefix":"10.1007","volume":"64","author":[{"given":"Marjan","family":"Abdeyazdan","sequence":"first","affiliation":[]},{"given":"Saeed","family":"Parsa","sequence":"additional","affiliation":[]},{"given":"Amir Masoud","family":"Rahmani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,12]]},"reference":[{"key":"845_CR1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s11227-007-0139-z","volume":"43","author":"S Jin","year":"2008","unstructured":"Jin S, Schiavone G, Turgut D (2008) A performance study of multiprocessor task scheduling algorithms. J Supercomput 43:77\u201397. doi: 10.1007\/s11227-007-0139-z","journal-title":"J Supercomput"},{"key":"845_CR2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s11227-009-0326-1","volume":"53","author":"Y ChoonLee","year":"2010","unstructured":"ChoonLee Y, Zomaya A, Siegel H (2010) Robust task scheduling for volunteer computing systems. J\u00a0Supercomput 53:163\u2013181. doi: 10.1007\/s11227-009-0326-1","journal-title":"J\u00a0Supercomput"},{"key":"845_CR3","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1007\/s11227-011-0555-y","volume":"59","author":"E Afgan","year":"2012","unstructured":"Afgan E, Bangalore P, Skala T (2012) Scheduling and planning job execution of loosely coupled applications. J Supercomput 59:1431\u20131454. doi: 10.1007\/s11227-011-0555-y","journal-title":"J Supercomput"},{"key":"845_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s11227-009-0333-2","volume":"53","author":"I Ababneh","year":"2010","unstructured":"Ababneh I, Bani-Mohammad S, Ould-Khaoua M (2010) An adaptive job scheduling scheme for mesh-connected multi computers. J Supercomput 53:5\u201325. doi: 10.1007\/s11227-009-0333-2","journal-title":"J Supercomput"},{"key":"845_CR5","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1007\/s11227-011-0612-6","volume":"61","author":"T Niemi","year":"2012","unstructured":"Niemi T, Hameri A (2012) Memory-based scheduling of scientific computing clusters. J Supercomput 61:520\u2013544. doi: 10.1007\/s11227-011-0612-6","journal-title":"J Supercomput"},{"key":"845_CR6","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1007\/s11227-010-0539-3","volume":"59","author":"K Qureshi","year":"2012","unstructured":"Qureshi K, Majeed B, Kazmi JH, Madani SA (2012) Task partitioning, scheduling and load balancing strategy for mixed nature of tasks. J Supercomput 59:1348\u20131359. doi: 10.1007\/s11227-010-0539-3","journal-title":"J Supercomput"},{"key":"845_CR7","volume-title":"4th international modelica conference","author":"P Aronsson","year":"2005","unstructured":"Aronsson P, Fritzson P (2005) A task merging technique for parallelization of modelica models. In: 4th international modelica conference, Hamburg"},{"key":"845_CR8","volume-title":"2nd international modelica conference","author":"P Aronsson","year":"2003","unstructured":"Aronsson P, Fritzson P (2003) Task merging and replication using graph rewriting. In: 2nd international modelica conference, Germany"},{"key":"845_CR9","unstructured":"Aronsson P, Fritzson P (2002) Multiprocessor scheduling of simulation code from modelica models"},{"key":"845_CR10","first-page":"110","volume-title":"Lecture notes in computer science","author":"S Parsa","year":"2007","unstructured":"Parsa S, Lotfi S, Lotfi N (2007) An evolutionary approach to task graph scheduling. In: Lecture notes in computer science, vol 4431, p 110"},{"key":"845_CR11","volume-title":"International conference on parallel processing","author":"S Kim","year":"1988","unstructured":"Kim S, Browne J (1988) A general approach to mapping of parallel computation upon multiprocessor architectures. In: International conference on parallel processing"},{"issue":"9","key":"845_CR12","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1145\/66451.66454","volume":"32","author":"C McCreary","year":"1989","unstructured":"McCreary C, Gill H (1989) Automatic determination of grain size for efficient parallel processing. Commun ACM 32(9):1073\u20131078","journal-title":"Commun ACM"},{"issue":"9","key":"845_CR13","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1109\/71.308533","volume":"5","author":"T Yang","year":"1994","unstructured":"Yang T, Gerasoulis A (1994) DSC: scheduling parallel tasks on an unbounded number of processors. IEEE Trans Parallel Distrib Syst 5(9):951\u2013967","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"845_CR14","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/71.80160","volume":"1","author":"M Wu","year":"1990","unstructured":"Wu M, Gajski D (1990) Hypertool: a programming aid for message-passing systems. IEEE Trans Parallel Distrib Syst 1(3):330\u2013343","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"845_CR15","volume-title":"International conference on parallel processing","author":"J Baxter","year":"1989","unstructured":"Baxter J, Patel J (1989) The LAST algorithm\u2014a heuristic-based static task allocation algorithm. In: International conference on parallel processing"},{"key":"845_CR16","first-page":"311","volume-title":"Lecture notes in computer science","author":"S Parsa","year":"2010","unstructured":"Parsa S, Reza Soltan N, Shariati S (2010) Task merging for better scheduling. In: Lecture notes in computer science, pp 311\u2013316"},{"key":"845_CR17","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-0-387-79448-8_10","volume-title":"Distributed and parallel system","author":"M Abdeyazdan","year":"2008","unstructured":"Abdeyazdan M, Rahmani AM (2008) Multiprocessor task scheduling using a new prioritizing genetic algorithm based on number of task children. In: Distributed and parallel system, pp 105\u2013114"},{"key":"845_CR18","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1006\/jpdc.1999.1578","volume":"59","author":"YK Kwok","year":"1999","unstructured":"Kwok YK, Ahmad I (1999) Benchmarking and comparison of the task graph scheduling algorithms. J Parallel Distrib Comput 59:381\u2013422","journal-title":"J Parallel Distrib Comput"},{"issue":"2","key":"845_CR19","first-page":"177","volume":"27","author":"I Ahmad","year":"2008","unstructured":"Ahmad I, Ranka S (2008) Using game theory for scheduling tasks on multi-core processors for simultaneous optimization of performance and energy. IEEE 27(2):177\u2013194","journal-title":"IEEE"},{"key":"845_CR20","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/s11227-007-0152-2","volume":"44","author":"K ChouLai","year":"2008","unstructured":"ChouLai K, Yang CT (2008) A dominant predecessor duplication scheduling algorithm for heterogeneous systems. J Supercomput 44:126\u2013145. doi: 10.1007\/s11227-007-0152-2","journal-title":"J Supercomput"},{"issue":"2","key":"845_CR21","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s00224-009-9191-9","volume":"47","author":"M Gairing","year":"2010","unstructured":"Gairing M, L\u00fccking T, Mavronicolas M, Monien B (2010) Computing Nash equilibria for scheduling on restricted parallel links. Theory Comput Syst 47(2):405\u2013432","journal-title":"Theory Comput Syst"},{"key":"845_CR22","doi-asserted-by":"crossref","unstructured":"Dummler J, Kunis R, Runger G (2012) SEParAT: scheduling support environment for parallel application task graphs. Clust Comput, online first","DOI":"10.1007\/s10586-012-0211-1"},{"issue":"4","key":"845_CR23","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s10586-009-0119-6","volume":"13","author":"S Baskiyar","year":"2010","unstructured":"Baskiyar S, Abdel-Kader R (2010) Energy aware DAG scheduling on heterogeneous systems. Clust Comput 13(4):373\u2013383","journal-title":"Clust Comput"},{"issue":"1\u20132","key":"845_CR24","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s11241-005-0505-y","volume":"30","author":"W Wang","year":"2005","unstructured":"Wang W, Mok AK, Fohler G (2005) Pre-scheduling. Real-Time Syst 30(1\u20132):83\u2013103","journal-title":"Real-Time Syst"},{"issue":"5","key":"845_CR25","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/s10766-009-0107-8","volume":"37","author":"MR Bonyadi","year":"2009","unstructured":"Bonyadi MR, Moghaddam ME (2009) A bipartite genetic algorithm for multi-processor task scheduling. Int J Parallel Program 37(5):462\u2013487","journal-title":"Int J Parallel Program"},{"issue":"2","key":"845_CR26","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s11227-010-0416-0","volume":"60","author":"K Li","year":"2012","unstructured":"Li K (2012) Energy efficient scheduling of parallel tasks on multiprocessor computers. J Supercomput 60(2):223\u2013247","journal-title":"J Supercomput"},{"issue":"3","key":"845_CR27","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1011186732749","volume":"19","author":"YK Kwok","year":"2001","unstructured":"Kwok YK (2001) Fault-tolerant parallel scheduling of tasks on a heterogeneous high-performance workstation cluster. J Supercomput 19(3):299\u2013314","journal-title":"J Supercomput"},{"key":"845_CR28","doi-asserted-by":"crossref","unstructured":"Tosun S (2011) Energy- and reliability-aware task scheduling onto heterogeneous MPSoC architectures. J Supercomput, online first","DOI":"10.1007\/s11227-011-0720-3"},{"key":"845_CR29","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"Nisan N, Roughgarden T, Tardos E, Vazirani V (2007) In: Algorithmic game theory. Cambridge University, New York, pp 301\u2013330"},{"issue":"2","key":"845_CR30","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1023\/B:SUPE.0000009321.92150.64","volume":"27","author":"O Sinnen","year":"2004","unstructured":"Sinnen O, Sousa L (2004) On task scheduling accuracy: evaluation methodology and results. J Supercomput 27(2):177\u2013194","journal-title":"J Supercomput"},{"key":"845_CR31","first-page":"87","volume-title":"Computational economics","author":"RD Kelvey Mc","year":"1996","unstructured":"Mc Kelvey RD, Mc Lennan A (1996) Computation of equilibria in finite games. In: Computational economics, vol 1, pp 87\u2013142"},{"issue":"2","key":"845_CR32","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"JF Nash","year":"1951","unstructured":"Nash JF (1951) Non-cooperative games. Ann Math 54(2):286\u2013295","journal-title":"Ann Math"},{"key":"845_CR33","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1145\/380752.380883","volume-title":"Proceedings of the 33rd annual ACM symposiumon theory of computing","author":"CH Papadimitriou","year":"2001","unstructured":"Papadimitriou CH (2001) Algorithms, games and the Internet. In: Proceedings of the 33rd annual ACM symposiumon theory of computing, pp 749\u2013753"},{"issue":"5","key":"845_CR34","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1109\/TC.2004.1275298","volume":"53","author":"H Aydin","year":"2004","unstructured":"Aydin H, Melhem R, Moss D, Meja-Alvarez P (2004) Power-aware scheduling for periodic real-time tasks. IEEE Trans Comput 53(5):584\u2013600","journal-title":"IEEE Trans Comput"},{"key":"845_CR35","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, New York"},{"key":"845_CR36","volume-title":"Euromicro international conference on parallel, distributed and network-based processing","author":"J Kang","year":"2008","unstructured":"Kang J, Ranka S (2008) Dynamic algorithms for energy minimization on parallel machines. In: Euromicro international conference on parallel, distributed and network-based processing"},{"key":"845_CR37","volume-title":"International parallel and distributed processing symposium","author":"SU Khan","year":"2006","unstructured":"Khan SU, Ahmad I (2006) Non-cooperative, semi-cooperative and cooperative games-based grid resource allocation. In: International parallel and distributed processing symposium"},{"key":"845_CR38","first-page":"250","volume-title":"International symposium on system synthesis","author":"MT Schmitz","year":"2001","unstructured":"Schmitz MT, Al-Hashimi BM (2001) Considering power variations of DVS processing elements for energy minimisation in distributed systems. In: International symposium on system synthesis, pp 250\u2013255"},{"key":"845_CR39","volume-title":"Satisfiability modulo graph theory for task mapping and scheduling on multiprocessor systems. Digital object indentifier","author":"L Weichen","year":"2010","unstructured":"Weichen L, Zonghua G, Jiang X, Xiaowen W, Yaoyao Y (2010) Satisfiability modulo graph theory for task mapping and scheduling on multiprocessor systems. Digital object indentifier. IEEE, New York"},{"key":"845_CR40","volume-title":"WEE international advance comnputing conference (IACC)","author":"A Agarwal","year":"2009","unstructured":"Agarwal A, Kumar P (2009) Economical duplication based task scheduling for heterogeneous and homogeneous computing systems. In: WEE international advance comnputing conference (IACC)"},{"key":"845_CR41","volume-title":"Proceedings of the 35th international conference on current, trends in theory and practice of computer science (SOFSEM)","author":"NK Thang","year":"2010","unstructured":"Thang NK (2010) NP-hardness of pure Nash equilibrium in scheduling and connection games. In: Proceedings of the 35th international conference on current, trends in theory and practice of computer science (SOFSEM), 2009"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-012-0845-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-012-0845-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-012-0845-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T15:00:57Z","timestamp":1562684457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-012-0845-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,12]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["845"],"URL":"https:\/\/doi.org\/10.1007\/s11227-012-0845-z","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,12]]}}}