Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29524


Select areas to restrict search in scientific publication database:
1365
Encoding and Compressing Data for Decreasing Number of Switches in Baseline Networks
Abstract:
This method decrease usage power (expenditure) in networks on chips (NOC). This method data coding for data transferring in order to reduces expenditure. This method uses data compression reduces the size. Expenditure calculation in NOC occurs inside of NOC based on grown models and transitive activities in entry ports. The goal of simulating is to weigh expenditure for encoding, decoding and compressing in Baseline networks and reduction of switches in this type of networks. KeywordsNetworks on chip, Compression, Encoding, Baseline networks, Banyan networks.
Digital Object Identifier (DOI):

References:

[1] J. Kim, C. Nicopoulos, D. Park, R. Das, Y. Xie, V. Narayanan, M. S. Yousif, and C. R. Das. A novel dimensionally-decomposed router for on-chip communication in 3D architectures. In Proc. of ISCA, 2007.
[2] N. S. Kim, T. Austin, D. Blaauw, T. Mudge, K. Flautner, J. Hu, M. Irwin, M. Kandemir, and N. Vijaykrishnan. Leakage current: Moores law meets static power. Computer, 36(12):6577, December 2003.
[3] S. Kolson, A. Jantsch, J.-P. Soininen, M. Forsell, M. Millberg, J. Oberg, K. Tiensyrja, and A. Hemani. A NoC architecture and design methodology.In Proc. of ISVLSI, 2002. World Academy of Science, Engineering and Technology 30 200938
[4] P. U. Tagle and N. K. Sharma, "Performance of Fault-Tolerant ATM Switch", IEE Proceedings on Communication, Vol. 143, No. 5 , pp. 318-324, October 1996
[5] Muhammad Anan and Mohsen Guizani Modeling and Simulation of A Fault Tolerant ATM Switching Architecture, proc. Of IEEE Simulation Symposium , pp. 42-47, 2000 .
[6] Neeraj K.Sharma Fault Tolerant Batcher Banyan Packet Switch , proc. Of IEEE Computing and Communications Conference, New Jersey, IEEE 1997 pp: 125-130, 1997.
[7] W.Syen E.Chen,Y.M.Kim ,Y.W.Yao and M.T.Liu FDB : A High Performance Fault Tolerant Switching Fabric for ATM Switching Systems, Proc. of the 10th IEEE International Phoenix Conference on Computers and communications, pp.703-709 , 1991 .
[8] soleymanpour m.javad Fault To levant Dedign of anyan Switch ,Communications Conference, Ikt Jan, IEEE 2004.
[9] Contribution of Packet Sizes to Packet and Byte Volumes, MCI vBNS http://www.nlanr.net/NA/Learn/ packetsize.html.
[10] Flow Counts as a Function of Flow Granularity, FIX-West,http://www.nlanr.ner/NA/Learn/aggregation.html.
[11] N. McKeown, Scheduling Algorithms for Input-Queued Cell Switches,Ph.D. thesis, Univ. Calif. Berkeley, May 1995.
[12] "Huffman encoding Data" URL:http://www.byui.edu/ricks/employee_ /C...5/chap10.5.pdf
[13] "Compressing Data" URL:http://ginger.cs.uwp.edu/C580/LZWovrhd.pdf
[14] N. McKeown, V. Anantharam, and J. Walrand, Achieving 100% Throughput in an Input-Queued Switch, Proc. IEEE INFOCOM 96, San Francisco, CA, Mar. 1996.
[15] C. Labovitz, G. R. Malan, and F. Jahanian, Internet Routing Instability, Proc. ACM SIGCOMM 97, Cannes, France, Sept. 1997.
[16] Han Wang, Hardware Designs for LT Coding, Faculty of Electrical Engineering, Mathematics and Computer Science, 2006 World Academy of Science, Engineering and Technology 30 200939
Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007