joshua samuel | Karunya University (original) (raw)
Related Authors
Centro de Investigación Científica y Educación Superior de Ensenada
Uploads
IJCSIS Volumes by joshua samuel
by maya jeevan, Nagaraju Sangepu, Lalitha Chandrashekar, Patrick Ngumbi S.a. Nssf, Shaik Fairooz, Steve Kruba, Loganathan C, joshua samuel, Ismail Ataie, Journal of Computer Science IJCSIS, Varadarajan Sourirajan, and Anandhi Jayadharmarajan
The International Journal of Computer Science and Information Security is a monthly periodical on... more The International Journal of Computer Science and Information Security is a monthly periodical on research articles in general computer science and information security which provides a distinctive technical perspective on novel technical research work, whether theoretical, applicable, or related to implementation.
Target Audience: IT academics, university IT faculties; and business people concerned with computer science and security; industry IT departments; government departments; the financial industry; the mobile industry and the computing industry.
https://sites.google.com/site/ijcsis/
Papers by joshua samuel
The tremendous potential of grid computing is efficient scheduling, to exploit the computationall... more The tremendous potential of grid computing is efficient scheduling, to exploit the computationally intense problems. In the commonly used decentralized models, large scale scheduling implies time sequence constraints, which makes the models intractable. To resolve this constraint, disintegration and cyclic scheduling are often applied to such scheduling which is time consuming and introducing more complexities. The significance of this paper is marked by speed and efficiency that the task-resource mapping in such a non-deterministic computing environment leads to concerns over scheduling problem to minimize the expected makespan and delay in allocation of tasks thereby reduce the turnaround time for precedence-constraint tasks imposed by application tasks to identify suitable resources. Our rigorous performance evaluation shows that our variant Expeditious Matching algorithm generates schedules with smaller makespan and higher robustness compared with other existing approach gratuit...
by maya jeevan, Nagaraju Sangepu, Lalitha Chandrashekar, Patrick Ngumbi S.a. Nssf, Shaik Fairooz, Steve Kruba, Loganathan C, joshua samuel, Ismail Ataie, Journal of Computer Science IJCSIS, Varadarajan Sourirajan, and Anandhi Jayadharmarajan
The International Journal of Computer Science and Information Security is a monthly periodical on... more The International Journal of Computer Science and Information Security is a monthly periodical on research articles in general computer science and information security which provides a distinctive technical perspective on novel technical research work, whether theoretical, applicable, or related to implementation.
Target Audience: IT academics, university IT faculties; and business people concerned with computer science and security; industry IT departments; government departments; the financial industry; the mobile industry and the computing industry.
https://sites.google.com/site/ijcsis/
The tremendous potential of grid computing is efficient scheduling, to exploit the computationall... more The tremendous potential of grid computing is efficient scheduling, to exploit the computationally intense problems. In the commonly used decentralized models, large scale scheduling implies time sequence constraints, which makes the models intractable. To resolve this constraint, disintegration and cyclic scheduling are often applied to such scheduling which is time consuming and introducing more complexities. The significance of this paper is marked by speed and efficiency that the task-resource mapping in such a non-deterministic computing environment leads to concerns over scheduling problem to minimize the expected makespan and delay in allocation of tasks thereby reduce the turnaround time for precedence-constraint tasks imposed by application tasks to identify suitable resources. Our rigorous performance evaluation shows that our variant Expeditious Matching algorithm generates schedules with smaller makespan and higher robustness compared with other existing approach gratuit...