CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Article:A Scheduling Algorithm for Asymmetric Processor Architecture

by S.Subha
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 11 - Number 11
Year of Publication: 2010
Authors: S.Subha
10.5120/1623-2182

S.Subha . Article:A Scheduling Algorithm for Asymmetric Processor Architecture. International Journal of Computer Applications. 11, 11 ( December 2010), 44-48. DOI=10.5120/1623-2182

@article{ 10.5120/1623-2182,
author = { S.Subha },
title = { Article:A Scheduling Algorithm for Asymmetric Processor Architecture },
journal = { International Journal of Computer Applications },
issue_date = { December 2010 },
volume = { 11 },
number = { 11 },
month = { December },
year = { 2010 },
issn = { 0975-8887 },
pages = { 44-48 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume11/number11/1623-2182/ },
doi = { 10.5120/1623-2182 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:00:27.653500+05:30
%A S.Subha
%T Article:A Scheduling Algorithm for Asymmetric Processor Architecture
%J International Journal of Computer Applications
%@ 0975-8887
%V 11
%N 11
%P 44-48
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Chip multiprocessors are used widely today. The cores in a chip can be homogeneous or heterogeneous. This paper proposes a scheduling algorithm for heterogeneous multiprocessors wotj, multiple functional units of varying speed in each processor. Instructions that can be scheduled in parallel are considered. An optimization function is developed to allocate the processes to the processors that minimize the overall execution time. The proposed model is simulated for a chosen example and verified to give 46% improvement in performance.

References
  1. Ioannis Chatzigiannakis, Georgios Giannoulis, Paul Spirakis, Scheduling Tasks with Dependencies on Asymmetric Multiprocessors, PODC, ‘08
  2. Nagesh B. Lakshminarayana, Jaekyu Lee, Hyesoon Kim, Age based scheduling for asymmetric multiprocessors, Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, 2009
  3. Qiong Cai , José González , Ryan Rakvic , Grigorios Magklis , Pedro Chaparro , Antonio González, Meeting points: using thread criticality to adapt multicore hardware to parallel regions, Proceedings of the 17th International Conference on Parallel Architectures and Compilation Techniques, 2008
  4. Saisanthosh Balakrishnan , Ravi Rajwar , Mike Upton , Konrad Lai, The Impact of Performance Asymmetry in Emerging Multicore Architectures, Proceedings of the 32nd annual international symposium on Computer Architecture, 2005, pp. 506-517
  5. S. Subha: An Algorithm for Parallel Execution of Loops in Chip Multiprocessor Caches, ARTCom 2009: 85-89
  6. S. Subha: A Scheduling Algorithm for Network on Chip, Advances in Computing, Control, and Telecommunication Technologies, International Conference on, pp.289-291
Index Terms

Computer Science
Information Sciences

Keywords

Chip multiprocessors Process scheduling

Powered by PhDFocusTM