Mostrar el registro sencillo del ítem

dc.contributor.authorPooranian, Zahra
dc.contributor.authorShojafar, Mohammad
dc.contributor.authorAbawajy, Jemal H.
dc.contributor.authorSinghal, Mukesh
dc.date2013-03
dc.date.accessioned2020-01-13T13:41:07Z
dc.date.available2020-01-13T13:41:07Z
dc.identifier.issn1989-1660
dc.identifier.urihttps://reunir.unir.net/handle/123456789/9690
dc.description.abstractThe purpose of grid computing is to produce a virtual supercomputer by using free resources available through widespread networks such as the Internet. This resource distribution, changes in resource availability, and an unreliable communication infrastructure pose a major challenge for efficient resource allocation. Because of the geographical spread of resources and their distributed management, grid scheduling is considered to be a NP-complete problem. It has been shown that evolutionary algorithms offer good performance for grid scheduling. This article uses a new evaluation (distributed) algorithm inspired by the effect of leaders in social groups, the group leaders' optimization algorithm (GLOA), to solve the problem of scheduling independent tasks in a grid computing system. Simulation results comparing GLOA with several other evaluation algorithms show that GLOA produces shorter makespans.es_ES
dc.language.isospaes_ES
dc.publisherInternational Journal of Interactive Multimedia and Artificial Intelligence (IJIMAI)es_ES
dc.relation.ispartofseries;vol. 02, nº 01
dc.relation.urihttps://www.ijimai.org/journal/node/421es_ES
dc.rightsopenAccesses_ES
dc.subjectartificial intelligencees_ES
dc.subjectdistributed computinges_ES
dc.subjectgrid computinges_ES
dc.subjectjob schedulinges_ES
dc.subjectmakespanes_ES
dc.subjectIJIMAIes_ES
dc.titleGLOA: A New Job Scheduling Algorithm for Grid Computinges_ES
dc.typearticlees_ES
reunir.tag~IJIMAIes_ES
dc.identifier.doihttp://dx.doi.org/10.9781/ijimai.2013.218


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem