UNITED STATES
An Optimized Algorithm for Network on Chip
|
10.5120/789-1118 |
S Subha. Article: An Optimized Algorithm for Network on Chip. International Journal of Computer Applications 3(12):23–25, July 2010. Published By Foundation of Computer Science. BibTeX
@article{key:article,
author = {S. Subha},
title = {Article: An Optimized Algorithm for Network on Chip},
journal = {International Journal of Computer Applications},
year = {2010},
volume = {3},
number = {12},
pages = {23--25},
month = {July},
note = {Published By Foundation of Computer Science}
}
Abstract
Network on a chip can be viewed as processors with various instruction sets residing on a chip. Programs issued to a particular processor type can be divided into sequential and parallel code. Each subtask is characterized by an estimated time for completion. This paper proposes a method to determine the topological arrangement of processors to minimize the total execution time. The tasks are assumed to be allocated based on the algorithm proposed in literature. The logical arrangement of processors is in a directed acyclic connected graph. This is achieved in a tree arrangement. The expression for total execution time in this topology is derived. The model is simulated and the model verified
Reference
-
Ceyda Oguz, M.Fikret Erca, etal, Heuristic Algorithms for Multiprocessor Task Scheduling in a Two-Stage-Flow-Shop, 2000
Dror G.Feitelson, Job Scheduling in Multiprogrammed Parallel Systems, 1997
Fang Wang, Scheduling in Multiprogrammed Parallel Systems , Research Report RC 19790 (87657), IBM T.J.Watson Research Center, 1997
Shashi Kumar et al, A Network on Chip Design and methodology, Proceedings of ISVLSI’02
Uwe Schwiegelshohn, Ramin Yahyapour, Analysis of First –Come- First –Serve Parallel Job Scheduling, Proceedings of the 9th SIAM Symposium on Discrete Algorithms, 1998
S.Subha, A Scheduling Algorithm for Network on Chip, Proceedings of ACT 2009, pp-289-291
