{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:52:41Z","timestamp":1743036761021,"version":"3.40.3"},"publisher-location":"India","reference-count":12,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132204862"},{"type":"electronic","value":"9788132204879"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-81-322-0487-9_31","type":"book-chapter","created":{"date-parts":[[2012,4,14]],"date-time":"2012-04-14T07:13:23Z","timestamp":1334387603000},"page":"321-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Tasks Scheduling Model for Performance Evaluation of a Distributed Computing System through Artificial Neural Network"],"prefix":"10.1007","author":[{"given":"M. P.","family":"Singh","sequence":"first","affiliation":[]},{"given":"P. K.","family":"Yadav","sequence":"additional","affiliation":[]},{"given":"Harendra","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Babita","family":"Agarwal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,15]]},"reference":[{"issue":"6","key":"31_CR1","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/TSE.1981.226469","volume":"7","author":"S.H. Bokhari","year":"1981","unstructured":"Bokhari, S.H.: A Shortest Tree Algorithm for Optimal Assignments across Space and Time in a Distributed Processor Systems. IEEE Trans. Software Eng. SE-7(6), 583\u2013589 (1981)","journal-title":"IEEE Trans. Software Eng. SE"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Bokhari, S.H.: Assignment Problem in Parallel and Distributed Computing. Kulwer Academic Publishers (1987)","DOI":"10.1007\/978-1-4613-2003-6"},{"issue":"l","key":"31_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/TSE.1977.233840","volume":"3","author":"H.S. Stone","year":"1977","unstructured":"Stone, H.S.: Multiprocessor Scheduling with the Aid of Network Flow Algorithms. IEEE Trans. Software SE-3(l), 85\u201393 (1977)","journal-title":"IEEE Trans. Software SE"},{"issue":"10","key":"31_CR4","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1109\/TSE.1986.6313018","volume":"12","author":"D.F. Towsley","year":"1986","unstructured":"Towsley, D.F.: Allocating Programs Containing Branches and Loops within a Multiple Processor System. IEEE Trans. Software Eng. SE-12(10), 1018\u20131024 (1986)","journal-title":"IEEE Trans. Software Eng. SE"},{"issue":"11","key":"31_CR5","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1109\/32.41334","volume":"15","author":"D.F. Baca","year":"1989","unstructured":"Baca, D.F.: Allocating Modules to Processors in a Distributed System. IEEE Trans. Software Eng. SE-15(11), 1427\u20131436 (1989)","journal-title":"IEEE Trans. Software Eng. SE"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/2.214443","volume":"6","author":"Ghafoor","year":"1993","unstructured":"Ghafoor, Yang, J.: A Distributed Heterogeneous Supercomputing Management System. IEEE Comput.\u00a06, 78\u201386 (1993)","journal-title":"IEEE Comput."},{"key":"31_CR7","unstructured":"Singh, M.P., Yadav, P.K., Kumar, H.: A Tasks Allocation Model for Efficient Utilization Of Processor\u2019s Capacity in Heterogeneous Distributed Systems. Presented 9th Conference of International Academy of Physical Sciences, Held at Agra University Agra February 03-05 (2007)"},{"key":"31_CR8","unstructured":"Cho, S.Y., Park, K.H.: Dynamic Task Assignment in Heterogeneous Linear Array Networks for Metacomputing. In: Proceeding of IPPS, pp. 66\u201371 (1994)"},{"issue":"7","key":"31_CR9","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1109\/12.256461","volume":"41","author":"C.H. Lee","year":"1992","unstructured":"Lee, C.H., Lee, D., Kim, M.: Optimal Task Assignment in Linear Array Networks. IEEE Trans. Comput.\u00a0C-41(7), 877\u2013880 (1992)","journal-title":"IEEE Trans. Comput."},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1109\/TSE.1979.234201","volume":"5","author":"S.H. Bokhari","year":"1979","unstructured":"Bokhari, S.H.: Dual Processor Scheduling with Dynamic Re-Assignment. IEEE Trans. On Software Engineering\u00a0SE-5, 341\u2013349 (1979)","journal-title":"IEEE Trans. On Software Engineering"},{"key":"31_CR11","unstructured":"Kumar, V., Singh, M.P., Yadav, P.K.: An Efficient Algorithm for Multiprocessor Scheduling with Dynamic Re-assignment. In: Proceeding of 6th National Seminar on Theoretical Computer Science, pp. 105\u2013118 (1996)"},{"key":"31_CR12","first-page":"1","volume":"578180","author":"P.K. Yadav","year":"2008","unstructured":"Yadav, P.K., Singh, M.P., Kumar, H.: Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Re-assignment. Journal of Computer Systems, Networks, and Communications (1), Article ID 578180, 1\u20139 (2008), doi:10.1155\/2008","journal-title":"Journal of Computer Systems, Networks, and Communications (1), Article ID"}],"container-title":["Advances in Intelligent and Soft Computing","Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20-22, 2011"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-0487-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T00:01:01Z","timestamp":1674518461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-0487-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9788132204862","9788132204879"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-0487-9_31","relation":{},"ISSN":["1867-5662","1867-5670"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1867-5670"}],"subject":[],"published":{"date-parts":[[2012]]},"assertion":[{"value":"15 April 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}