Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Rintu Nath"'
Autor:
Rintu Nath
Publikováno v:
Advanced Technologies and Societal Change ISBN: 9789811957222
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::26063084720956ca936f7be78efaa1d5
https://doi.org/10.1007/978-981-19-5723-9_3
https://doi.org/10.1007/978-981-19-5723-9_3
Autor:
Aitha Nagaraju, Rintu Nath
Publikováno v:
International Journal of Computers and Applications. 44:887-896
This paper models a dynamic task scheduling problem on a distributed computing platform and proposes a strategy for mapping tasks to resources. It presents an adaptive scheduling approach, ‘Dynamic...
Autor:
Rintu Nath, Aitha Nagaraju
Publikováno v:
International Journal of Information Technology. 14:1505-1514
This paper models a dynamic task scheduling problem on a distributed computing platform. It presents a new cyclic scheduling approach for multiple task scientific applications. We propose a scheduling algorithm CEFT—Cyclic Earliest Finish Time algo
Autor:
Rintu Nath
Publikováno v:
Advanced Technologies and Societal Change ISBN: 9789811929830
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::142d71f036141bd051d9cc1dbe308259
https://doi.org/10.1007/978-981-19-2984-7_11
https://doi.org/10.1007/978-981-19-2984-7_11
Autor:
Rintu Nath
Publikováno v:
Research Bulletin. 48:113
Autor:
Satyajit Chakrabarti, Rintu Nath, Pradipta Kumar Banerji, Sujit Datta, Sanghamitra Poddar, Malay Gangopadhyaya
The conference on ‘Interdisciplinary Research in Technology and Management” was a bold experiment in deviating from thetraditional approach of conferences which focus on a specific topic or theme. By attempting to bring diverse inter-relatedtopic
Autor:
Rintu Nath
Publikováno v:
The Management Accountant Journal. 55:56
Autor:
Rintu Nath, Aitha Nagaraju
Publikováno v:
2017 International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS).
Task assignment in a distributed computing system is a NP-hard problem and a number of heuristics are available for optimal performance. In this paper a novel approach of using local search for satisfiability along with earliest finish time heuristic