NoC-Based SoC Test Scheduling Using Ant Colony Optimization
نویسندگان
چکیده
Jin-Ho Ahn et al. 129 In this paper, we propose a novel ant colony optimization (ACO)-based test scheduling method for testing network-on-chip (NoC)-based systems-on-chip (SoCs), on the assumption that the test platform, including specific methods and configurations such as test packet routing, generation, and absorption, is installed. The ACO metaheuristic model, inspired by the ant’s foraging behavior, can autonomously find better results by exploring more solution space. The proposed method efficiently combines the rectangle packing method with ACO and improves the scheduling results by dynamically choosing the test-access-mechanism widths for cores and changing the testing orders. The power dissipation and variable test clock mode are also considered. Experimental results using ITC’02 benchmark circuits show that the proposed algorithm can efficiently reduce overall test time. Moreover, the computation time of the algorithm is less than a few seconds in most cases.
منابع مشابه
Resource leveling scheduling by an ant colony-based model
In project scheduling, many problems can arise when resource fluctuations are beyond acceptable limits. To overcome this, mathematical techniques have been developed for leveling resources. However, these produce a hard and inflexible approach in scheduling projects. The authors propose a simple resource leveling approach that can be used in scheduling projects with multi-mode execution activit...
متن کاملOn NoC Bandwidth Sharing for the Optimization of Area Cost and Test Application Time
Current NoC test scheduling methodologies in the literature are based on a dedicated path approach; a physical path through the NoC routers and interconnects are allocated for the transportation of test data from an external tester to a single core during the whole duration of the core test. This approach unnecessarily limits test concurrency of the embedded cores because a physical channel ban...
متن کاملEnhanced Ant Colony Algorithm Hybrid with Particle Swarm Optimization for Grid Scheduling
This chapter proposes new heuristic algorithms to solve grid scheduling problem. Two heuristic algorithms, based on Ant Colony Optimization and Particle Swarm Optimization are proposed. The optimization criteria, namely, flowtime and makespan are used to measure the quality of grid scheduling algorithm. Using the simulated benchmark instances, the results of different algorithms are analyzed an...
متن کاملTask Scheduling of parallel programming systems using Ant Colony Optimization
Efficient scheduling of tasks for an application is critical for achieving high performance in heterogeneous computing environment. The task scheduling has been shown to be NP complete in general case and also in several restricted cases. The paper introduces a novel framework for task scheduling problem based on Ant colony optimization (ACO). The performance of the algorithm is demonstrated by...
متن کاملPareto Set-based Ant Colony Optimization for Multi-Objective Surgery Scheduling Problem
Surgery scheduling determines the individual surgery’s sequence and assigns required resources. This task plays a decisive role in providing timely treatment for the patients while ensuring a balanced hospital resources’ utilization. Considering several real life constraints associated with multiple resources during the complete 3-stage surgery flow, a surgery scheduling model is presented with...
متن کامل