In this paper, a BCC-DPSO scheduling algorithm is proposed to solve multi-objective optimization problem for task scheduling on Network-on-Chip (NoC). In our proposal, the relative advantage of the solution is evaluated by calculating its efficiency using BCC model in Data Envelopment Analysis (DEA), and the referred-time method is introduced to rank the BCC-efficient solution. Moreover, a sub-swarm strategy is adopted to reduce the high computational requirement introduced by the DEA. There are four sub-swarms, each of which optimizes one of four observed metrics, namely makespan, energy, link load and workload balance. Meanwhile, the speed vector updating formulation is modified to comply with the sub-swarm strategy. By conducting comparative simulations, the results show that our proposal produces more efficient schedule solution than other multi-objective Particle Swarm Optimization (PSO).
목차
Abstract 1. Introduction 2. Problem Formulation 2.1. Task Model 2.2. NoC Structure 2.3. Metrics 3. The Proposed Algorithm 3.1. The Input-oriented BCC Model 3.2. Referred-time 3.3. Sub-swarm Strategy 3.4. The Algorithm Flow 4. Experiment and Discuss 4.1. Test Bed 4.2. Comparative Simulation 5. Conclusion and Future Study Acknowledgements References
보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Grid and Distributed Computing
간기
격월간
pISSN
2005-4262
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing Vol.7 No.5