DSpace Repository

Scheduling Algorithm for Asymmetric Multicore Platforms using Non-uniform Laxity based Clustering and Duplication

Show simple item record

dc.contributor.author K., Pradheep Kumar
dc.date.accessioned 2023-01-17T10:36:08Z
dc.date.available 2023-01-17T10:36:08Z
dc.date.issued 2012-10
dc.identifier.uri https://www.europeanjournalofscientificresearch.com/ejsr_issues.html
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8526
dc.description.abstract In this paper, a new scheduling algorithm using task clustering and non-uniform laxity is proposed. This algorithm forms task clusters after analyzing the task dependencies. For each task cluster comprising of a parent and dependent tasks, a cluster parameter is computed. Based on this parameter, a rank is assigned to each cluster. The clusters are scheduled in the order of their rank, so as to minimize the communication cost and reduce the utilization of slack resources. Clusters are scheduled as far as possible on the same core. If a cluster cannot be scheduled completely on the same core, the parent task is either migrated or duplicated depending on the associated costs involved. The algorithm has been tested using 15 different programs as tasks. en_US
dc.language.iso en en_US
dc.publisher European Journal of Scientific Research en_US
dc.subject Computer Science en_US
dc.subject Algorithm en_US
dc.title Scheduling Algorithm for Asymmetric Multicore Platforms using Non-uniform Laxity based Clustering and Duplication en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account