Reliability Analysis of Gamma Interconnection Network Systems

Size: px
Start display at page:

Download "Reliability Analysis of Gamma Interconnection Network Systems"

Transcription

1 International Journal of Performability Engineering, Vol. 5, No. 5, October 9, pp RAMS Consultants Printed in India Reliability Analysis of Gamma Interconnection Network Systems 1. Introduction INDRA GUNAWAN 1* and GAN MING LEE 1 Department of Mechanical and Manufacturing Engineering Auckland University of Technology, New Zealand Department of Systems Engineering and Management Malaysia University of Science and Technology, Malaysia (Received on September 8, 8 and finally revised on May, 9) Abstract: Gamma Interconnection Network (GIN) is a type of Multistage Interconnection Network (MIN) that consists of layers of switching elements connected together in a predefined topology providing the connectivity between the set of processors and the set of memory modules. GIN is constructed by 1x, x and x1 switching elements. In this paper, network reliability of four other different types of Gamma hybrid networks namely Monogamma Interconnection Network (MGIN), Reliable Gamma Interconnection Network (REGIN), Cyclic Gamma Interconnection Network () and Extra Stage Gamma Network (ESGN) are analyzed. The results from the proposed simulation method show that the ESGN, and REGIN exhibit high network reliability performance. This is subsequently followed by the MGIN, with a marginal network reliability improvement compared to the GIN. It is also shown that the reliability model used for simulation closely approximates the exact network reliability of MGIN,, and REGIN. Keywords: Interconnection, multistage, network, reliability, stages and switching element. Interconnection network is used for inter-processor or processor-memory communication. The purpose of integrating interconnection network into a system is to enable it to perform parallel processing. Computational power and speed is greatly increased with the help of parallel processing. Among some applications that require parallel processing are real-time simulations, image processing, weather forecasting, air-traffic control, and speech recognition. SIMD (single-instruction stream-multiple-data stream) machine is an example of where the interconnection network is incorporated into a system to perform parallel processing. The SIMD machines could be either in the Processing-Element-to-Processing-Element or Processor-to-Memory configuration. Other examples of parallel-machines models are the MIMD (multiple-instruction stream-multiple-data stream) and the multiple-simd [1]. *Corresponding author s indra.gunawan@aut.ac.nz 485

2 486 I. Gunawan and M. L. Gan Since the interconnection network plays an important role by providing communication between multiple processors or between processors and memory, failure in the interconnection network may cause the whole system to fail. Thus the reliability of the interconnection network becomes a concern [6-1]. There are three different types of reliability analysis for interconnection network which are terminal to terminal (between one switch at input stage and one switch at output stage, also known as terminal reliability), terminal to all (among one switch at input stage and all switches at output stage, also known as broadcast reliability) and all to all (among all switches at input stage and all switches at output stage, also known as network reliability) [1]. Reliability of the network is usually measured by the number of Switching Element (SE) failures tolerated. The network is considered failed once the connection between an input and output is broken. This paper analyzes the network reliability of the Gamma Interconnection Network (GIN) and its hybrid networks. The paper is organized as follows: Section gives a brief overview about the Gamma Interconnection Network (GIN) and its hybrids. Section discusses how the networks are modeled in the proposed simulation method. Section 4 evaluates the accuracy of the simulated data and extends the analysis on other network variants and sizes Finally, Section 5 concludes the paper.. Gamma Interconnection Network (GIN) and Its Hybrid Networks The Gamma Interconnection Network (GIN) [1-4, 9, 11-1, 14] is a type of Multistage Interconnection Network (MIN). Figure 1 shows an 8x8 Gamma Network. Each Switching Element is represented by a block. Generally, the GIN is made up of 1x SEs at the input stage, x SEs at the intermediate stages and x1 SEs at the output stage. Figure 1: 8 x 8 Gamma Network (GIN)

3 Reliability Analysis of Gamma Interconnection Network 487 Tag Value (x) has positive and negative values. Both values are essential to generate the Routing Paths. The initial Tag Value is defined as the difference between the Output Number (O), and the Input Number (I). x = O I (1) where, x = Tag Value (could be either positive or negative value) O = Output Number I = Input Number The relationship between the positive and negative Tag Value is: where, x = x + N ve ve () N = Total number of Inputs or Outputs. However, when the Tag Value equals zero, x =, there exists only one Routing Path in the GIN. Tag Value (x) equals zero means the Input Number is equals to the Output Number. This characteristic makes the GIN not fault tolerant. Any SE failure will cause the Routing Path with Tag Value equals zero to be broken. Thus network failure occurs. Various GIN hybrids have been proposed to increase the number of paths for connections when Tag Value equals zero. The Extra Stage Gamma Network (ESGN) [11] adds a redundant Link Stage to the GIN. Three other GIN hybrids namely the Monogamma Interconnection Network (MGIN) [4], Reliable Gamma Interconnection Network (REGIN) [14] and Cyclic Gamma Interconnection Network () [4] introduce some modifications to the existing GIN interconnection pattern.. Network Reliability Modeling Although modifications made to the gamma network increases the number of possible paths for all Tag Values, these paths are not necessarily disjointed. Disjoint paths are paths that do not share the same SEs in the intermediate stages. Thus when one of the SE in the intermediate stage fails, it may break one or more paths which could result in network failure. Reliability analysis is needed to determine the fault tolerant level of the interconnection network. Several assumptions are made for the analysis: all the links in the network are considered to be more reliable than the switches, all switches are assumed to have the same reliability (r) or unreliability (q) and fail independently, switches are either completely working or completely fail, the first and last stages of switches are assumed to be always operational. The reliability of GIN and its hybrids are analyzed by simulation using Crystal Ball [5]. Crystal Ball is an Add-Ins for Microsoft Excel. Before running the simulation, the network must first be modeled into a Microsoft Excel spreadsheet. Figure explains the Flowchart for modeling and analyzing the network reliability of GIN and its hybrid networks. Analysis is done on the following networks: 8x8 GIN, 8x8 ESGN, 8x8, 8x8 REGIN, 16x16 GIN, 16x16 ESGN, 16x16 MGIN 4, 16x16 MGIN, 8x8 4 and REGIN 4. The expression that precedes the network abbreviation represents the 16x16 number of inputs and outputs in the network. For example, 8x8 means the network has eight

4 488 I. Gunawan and M. L. Gan inputs and eight outputs. The abbreviation for MGIN, and REGIN each has a subscript and superscript term. The subscript term for the MGIN, and REGIN refers to the total number of Link Stage in the network. The MGIN abbreviation can also be written without the superscript term [4]. The superscript specifies the connection pattern of the first and last Link Stage [4] while the REGIN superscript indicates the SE Stage number that the modification of the connection pattern begins [14]. Figure : Flowchart for Modeling and Simulating the Gamma Network and Its Hybrids The following steps describe in detail the flowchart above: Step : Begin Network Modeling Step 1: Set Input M as Step : Check whether M is greater than (Total Input, N)-1. If M is greater than (N-1) proceed to Step 8 or else proceed to Step Step : Set Tag Value x as Step 4: Check whether Tag Value x is greater than (Total Input, N)-1. If x is greater than N-1 proceed to Step 7 or else proceed to Step 5

5 Reliability Analysis of Gamma Interconnection Network 489 Step 5: Program all possible paths from Input M to Output associated with Tag Value x Step 6: Increment current Tag Value x by 1 and proceed to Step 4 Step 7: Increment current value of M by 1 and proceed to Step Step 8: Step 9: Step 1: Step 11: End Network Modeling. Set simulation parameter Run simulation. (While simulation is running, the number of trial success and failure will be recorded by Crystal Ball and the average network reliability computed) Simulation ends. Obtain final average network reliability. End Crystal Ball utilizes Monte Carlo simulation method to dynamically produce alternative situations of the spreadsheet model [5]. Hundreds or thousands of trials can be simulated by using Crystal Ball. 4. Network Reliability Analysis Various schemes have been suggested to increase the fault-tolerant capability of the GIN. This, as explained earlier, is through introducing modifications on the existing GIN design topology that result in an increase of connection paths for a given Tag Value. But, there is very little numerical analysis carried out that actually calculates the reliability value of the GIN and its hybrid. As the network size increases, the process to obtain the exact reliability through conventional method such as the matrix enumeration [1] becomes very tedious. Even on a network size of 16x16, it is virtually unfeasible to analyze all possible permutations. Nevertheless, with the help of Crystal Ball, this complexity is reduced considerably. The following section compares some results produced from Crystal Ball with the actual exact value. Subsequently, it discusses the network reliability of the GIN, MGIN, REGIN, and ESGN of size 8x8 and 16x16 that are modeled using Crystal Ball. The simulation is set to run a maximum of 1, trials with the SE reliability, r, varying from.99 to Comparison of Results from Simulation and Exact Network Reliability Values By using the matrix enumeration method [1], the exact derived network reliability of the 8x8 MGIN, 8x8 and 8x8 REGIN are as follows; 8x8 8x8 8x8 MGIN : R MGIN = r 16 (11r 14 (1-r) + 8r 15 (1-r) + r 16 ) () : R = r 16 (4r 1 (1-r) r 1 (1-r) + 48r 14 (1-r) + 16r 15 (1-r) + r 16 ) (4) REGIN : R REGIN = r 16 (4r 1 (1-r) + 4r 14 (1-r) + 16r 15 (1-r) + r 16 ) (5) where, R = Network Reliability and r = SE reliability. Figure, 4 and 5 compare the network reliability of the 8x8 MGIN, 8x8 and 8x8 REGIN obtained through Crystal Ball simulation with the exact derived reliability values.

6 49 I. Gunawan and M. L. Gan Network Reliability (R) 8x8 MGIN (,) Network Reliability Crystal Ball Values Exact Derived Values Network Reliability (r) x8 (,) Network Reliability Crystal Ball Values Exact Derived Values Figure : 8x8 MGIN Network Reliability Figure 4: 8x8 Network Reliability 8x8 REGIN (,) Network Reliability Network Reliability (R) Crystal Ball Values Exact Derived Values Figure 5: REGIN Network Reliability From the graph shown in Figure, 4 and 5, the network reliability values obtained through Crystal Ball simulation closely approximate the exact derived network values. Thus it can be concluded that the values produced via Crystal Ball simulation is fairly accurate. This

7 Reliability Analysis of Gamma Interconnection Network 491 provides the basis to further extend the analysis on other network variants as well as networks of larger sizes. 4. GIN, MGIN, REGIN, and ESGN Network Reliability Figures 6 and 7 show the network reliability of GIN, MGIN, REGIN, and ESGN. The sizes of the network simulated are 8x8 and 16x16. Network Reliability (R) Crystal Ball Simulated Network Reliability (size 8x8) MGIN (,) (,) GIN REGIN (,) ESGN Network Reliability (R) Crystal Ball Simulated Network Reliability (size 16x16) GIN REGIN (,4) (,4) MGIN (,4) ESGN Figure 6: 8x8 GIN,, MGIN, REGIN and ESGN Network Reliability Figure 7: 16x16 GIN,, MGIN, REGIN and ESGN Network Reliability From the simulation results of these five gamma networks in Figures 6 and 7, the ESGN, REGIN and can be considered to be the most reliable in terms of network reliability. The GIN has the lowest network reliability. With a slight modification on the GIN to form the MGIN, the network reliability increases slightly compared to the GIN. These characteristic remains consistent as the size of the network increases from 8x8 to 16x Conclusion This paper introduces a simulation method to model and analyze the network reliability of the Gamma Interconnection Network and its hybrid networks. The implementation of Crystal Ball significantly reduces the network complexity. As shown earlier, the approach is able to produce an estimated result which closely approximates the exact network reliability. Apart from the network reliability, this proposed methodology of modeling the GIN, MGIN,, REGIN and ESGN could be applied to estimate the terminal and broadcast reliability as well. By generalizing the modeling approach, it can be used on almost any type of interconnection network systems.

8 49 I. Gunawan and M. L. Gan Acknowledgement: The authors would like to thank anonymous referees and the editor for improving the manuscript to the present form. References [1] Chen, C. W., N. P. Lu, T. F. Chen, and C. P. Chung, Fault Tolerant Gamma Interconnection Network by Chaining, IEE Proceedings Comput. Digit. Tech.; 147 (): 75-81,. [] Chen, C. W. and C. P. Chung, Fault Tolerant Gamma Interconnection Network Without Backtracking. The Journal of Systems and Software; 58(1): -1, 15 Aug. 1. [] Chen, C. W., N. P. Lu, and C. P. Chung, -Disjoint Gamma Interconnection Network. The Journal of Systems and Software; 66 ():19-14, May. [4] Chuang, P., : A Fault Tolerant Modified Gamma Interconnection Network. IEEE Transactions on Parallel and Distributed Systems, 7 (1), 11-16, [5] Decisioneering, Inc. Crystal Ball Tutorial. Retrieved 5 th May 6 from [6] Fard, N. S. and I. Gunawan, Terminal Reliability Improvement of Shuffle-Exchange Network Systems. International Journal of Reliability, Quality and Safety Engineering; 1 (1): [7] Gunawan, I., Multistage Interconnection Networks Reliability Evaluation Based on Stratified Sampling Monte Carlo Method. International Journal of Modelling and Simulation; 8 (): 9-14, 8. [8] Gunawan, I., Performance Analysis of a Multistage Interconnection Network System Based on a Minimum Cut Set Method. International Journal of Performability Engineering; 4 (): 111-1, 8. [9] Gunawan, I., Redundant Paths and Reliability Bounds in Gamma Networks. Applied Mathematical Modelling. (4): , 8. [1] Gunawan, I., Reliability Analysis of Shuffle-Exchange Network Systems. Reliability Engineering and System Safety; 9 (): 71-76, 8. [11] Lee, K.Y., and W. Hegazy, The Extra Stage Gamma Network. IEEE Transactions on Computers; 7 (11): , [1] Parker, D. S., and C. S. Raghavendra, The Gamma Network: A Multiprocessor Interconnection Network with Redundant Paths. ACM SIGARCH Computer Architecture News; 1 (): 7-8, 198. [1] Siegel, H. J., Interconnection Networks for Large Scale Parallel Processing ( nd ed.). McGraw-Hill Publishing Company, New York, 199. [14] Tzeng, N. F., P. J. Chuang, and C. H. Wu, Creating Disjoint Paths in Gamma Interconnection Networks. IEEE Transactions on Computers; 4 (1):146-15, 199. Indra Gunawan is a Senior Lecturer in the Department of Mechanical and Manufacturing Engineering at Auckland University of Technology, New Zealand. He completed his Ph.D. degree in Industrial Engineering from Northeastern University, USA. His main areas of research are reliability engineering, production and operations management, application of operations research, applied statistics, probability modeling, and project management. Besides IJPE, he has published papers in IJRQSE, RESS, IJMS, AMM, and other journals. Gan Ming Lee received his M. Sc. in Systems Engineering and Management from Malaysia University of Science and Technology (MUST). His research interest is in the area of reliability modeling of interconnection network systems.

Available online at ScienceDirect. Procedia Computer Science 70 (2015 )

Available online at  ScienceDirect. Procedia Computer Science 70 (2015 ) Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 0 (0 ) th International Conference on Eco-friendly Computing and Communication Systems, ICECCS 0 Terminal Reliability Assessment

More information

Analysis of Crosspoint Cost and Buffer Cost of Omega Network Using MLMIN

Analysis of Crosspoint Cost and Buffer Cost of Omega Network Using MLMIN RESEARCH ARTICLE OPEN ACCESS Analysis of Crosspoint Cost and Buffer Cost of Omega Network Using MLMIN Smilly Soni Pursuing M.Tech(CSE RIMT, Mandi Gobindgarh Abhilash Sharma Assistant Prof. (CSE RIMT, Mandi

More information

Subset Cut Enumeration of Flow Networks with Imperfect Nodes

Subset Cut Enumeration of Flow Networks with Imperfect Nodes International Journal of Performability Engineering Vol. 11, No. 1, January 2015, pp. 81-90. RAMS Consultants Printed in India Subset Cut Enumeration of Flow Networks with Imperfect Nodes SUPARNA CHAKRABORTY*,

More information

On a Fast Interconnections

On a Fast Interconnections IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.8, August 2010 75 On a Fast Interconnections Ravi Rastogi and Nitin* Department of Computer Science & Engineering and Information

More information

This chapter provides the background knowledge about Multistage. multistage interconnection networks are explained. The need, objectives, research

This chapter provides the background knowledge about Multistage. multistage interconnection networks are explained. The need, objectives, research CHAPTER 1 Introduction This chapter provides the background knowledge about Multistage Interconnection Networks. Metrics used for measuring the performance of various multistage interconnection networks

More information

Reliability Analysis of Modified Irregular Augmented Shuffle Exchange Network (MIASEN)

Reliability Analysis of Modified Irregular Augmented Shuffle Exchange Network (MIASEN) www.ijcsi.org https://doi.org/10.20943/01201703.5964 59 Reliability Analysis of Modified Irregular Augmented Shuffle Exchange Network (MIASEN) Shobha Arya 1 and Nipur Singh 2 1,2 Department of Computer

More information

ZeroX Algorithms with Free crosstalk in Optical Multistage Interconnection Network

ZeroX Algorithms with Free crosstalk in Optical Multistage Interconnection Network ZeroX Algorithms with Free crosstalk in Optical Multistage Interconnection Network M.A.Al-Shabi Department of Information Technology, College of Computer, Qassim University, KSA. Abstract Multistage interconnection

More information

Performance Study of Packet Switching Multistage Interconnection Networks

Performance Study of Packet Switching Multistage Interconnection Networks ETRI Journal, volume 16, number 3, October 1994 27 Performance Study of Packet Switching Multistage Interconnection Networks Jungsun Kim CONTENTS I. INTRODUCTION II. THE MODEL AND THE ENVIRONMENT III.

More information

A Novel Algorithm to Estimate the Reliability of Hybrid Computer Communication Networks

A Novel Algorithm to Estimate the Reliability of Hybrid Computer Communication Networks Journal of Signal and Information Processing, 013, 4, 394-399 Published Online November 013 (http://www.scirp.org/journal/jsip) http://dx.doi.org/10.436/jsip.013.44050 A Novel Algorithm to Estimate the

More information

OPTIMAL MULTI-CHANNEL ASSIGNMENTS IN VEHICULAR AD-HOC NETWORKS

OPTIMAL MULTI-CHANNEL ASSIGNMENTS IN VEHICULAR AD-HOC NETWORKS Chapter 2 OPTIMAL MULTI-CHANNEL ASSIGNMENTS IN VEHICULAR AD-HOC NETWORKS Hanan Luss and Wai Chen Telcordia Technologies, Piscataway, New Jersey 08854 hluss@telcordia.com, wchen@research.telcordia.com Abstract:

More information

Efficient Prefix Computation on Faulty Hypercubes

Efficient Prefix Computation on Faulty Hypercubes JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 17, 1-21 (21) Efficient Prefix Computation on Faulty Hypercubes YU-WEI CHEN AND KUO-LIANG CHUNG + Department of Computer and Information Science Aletheia

More information

Analysis and Comparison of Torus Embedded Hypercube Scalable Interconnection Network for Parallel Architecture

Analysis and Comparison of Torus Embedded Hypercube Scalable Interconnection Network for Parallel Architecture 242 IJCSNS International Journal of Computer Science and Network Security, VOL.9 No.1, January 2009 Analysis and Comparison of Torus Embedded Hypercube Scalable Interconnection Network for Parallel Architecture

More information

Error Correction and Detection using Cyclic Redundancy Check

Error Correction and Detection using Cyclic Redundancy Check Error Correction and Detection using Cyclic Redundancy Check Dr. T. Logeswari Associate Professor, Dept of Computer Science, New Horizon College, Banglore, Karnataka, India ABSTRACT: In this paper Cyclic

More information

Scalable crossbar network: a non-blocking interconnection network for large-scale systems

Scalable crossbar network: a non-blocking interconnection network for large-scale systems J Supercomput DOI 10.1007/s11227-014-1319-2 Scalable crossbar network: a non-blocking interconnection network for large-scale systems Fathollah Bistouni Mohsen Jahanshahi Springer Science+Business Media

More information

ANALYSIS AND EVALUATION OF DISTRIBUTED DENIAL OF SERVICE ATTACKS IDENTIFICATION METHODS

ANALYSIS AND EVALUATION OF DISTRIBUTED DENIAL OF SERVICE ATTACKS IDENTIFICATION METHODS ANALYSIS AND EVALUATION OF DISTRIBUTED DENIAL OF SERVICE ATTACKS IDENTIFICATION METHODS Saulius Grusnys, Ingrida Lagzdinyte Kaunas University of Technology, Department of Computer Networks, Studentu 50,

More information

FPGA Implementation of Double Error Correction Orthogonal Latin Squares Codes

FPGA Implementation of Double Error Correction Orthogonal Latin Squares Codes FPGA Implementation of Double Error Correction Orthogonal Latin Squares Codes E. Jebamalar Leavline Assistant Professor, Department of ECE, Anna University, BIT Campus, Tiruchirappalli, India Email: jebilee@gmail.com

More information

Dr e v prasad Dt

Dr e v prasad Dt Dr e v prasad Dt. 12.10.17 Contents Characteristics of Multiprocessors Interconnection Structures Inter Processor Arbitration Inter Processor communication and synchronization Cache Coherence Introduction

More information

Triangle Graphs and Simple Trapezoid Graphs

Triangle Graphs and Simple Trapezoid Graphs JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 18, 467-473 (2002) Short Paper Triangle Graphs and Simple Trapezoid Graphs Department of Computer Science and Information Management Providence University

More information

Computing Submesh Reliability in Two-Dimensional Meshes

Computing Submesh Reliability in Two-Dimensional Meshes Computing Submesh Reliability in Two-Dimensional Meshes Chung-yen Chang and Prasant Mohapatra Department of Electrical and Computer Engineering Iowa State University Ames, Iowa 511 E-mail: prasant@iastate.edu

More information

Application of Heuristics to Solve Scheduling Problems of Intermediate Transfer Policies in Multiproduct Chemical Batch Processes

Application of Heuristics to Solve Scheduling Problems of Intermediate Transfer Policies in Multiproduct Chemical Batch Processes Application of Heuristics to Solve Scheduling Problems of Intermediate Transfer Policies in Multiproduct Chemical Batch Processes A. Shafeeq, A. Muhammad, R.U.Khan, M. Azam Institute of Chemical Engineering

More information

Data parallel algorithms 1

Data parallel algorithms 1 Data parallel algorithms (Guy Steele): The data-parallel programming style is an approach to organizing programs suitable for execution on massively parallel computers. In this lecture, we will characterize

More information

SIMULATION AND MONTE CARLO

SIMULATION AND MONTE CARLO JHU course no. 550.790, Modeling, Simulation, and Monte Carlo SIMULATION AND MONTE CARLO Some General Principles James C. Spall Johns Hopkins University Applied Physics Laboratory September 2004 Overview

More information

Data Access on Wireless Broadcast Channels using Keywords

Data Access on Wireless Broadcast Channels using Keywords Data Access on Wireless Broadcast Channels using Keywords Mr. Vijaykumar Mantri 1, Mr. Nagaraju A 2 Dept of IT, Padmasri Dr. B. V. Raju Institute of Technology, Narsapur, Dist.Medak, Andhra Pradesh, India.

More information

Network Reliability Computation by using Different Binary Decision Diagrams

Network Reliability Computation by using Different Binary Decision Diagrams Network Reliability Computation by using Different Binary Decision Diagrams Manoj Singhal 1, R. K. Chauhan 2, Girish Sharma 3 1 Asso. Prof., Deptt. Of MCA, Academy of Business and Engineering Sciences,

More information

Comparative Study of blocking mechanisms for Packet Switched Omega Networks

Comparative Study of blocking mechanisms for Packet Switched Omega Networks Proceedings of the 6th WSEAS Int. Conf. on Electronics, Hardware, Wireless and Optical Communications, Corfu Island, Greece, February 16-19, 2007 18 Comparative Study of blocking mechanisms for Packet

More information

Block diagram overview of PASM.

Block diagram overview of PASM. ANALYSIS OF THE PASM CONTROL SYSTEM MEMORY HIERARCHY David Lee Tuomenoksa Howard Jay Siegel Purdue University School of Electrical Engineering West Lafayette, IN 47907 Abstract - Many proposed large-scale

More information

Equivalent Permutation Capabilities Between Time-Division Optical Omega Networks and Non-Optical Extra-Stage Omega Networks

Equivalent Permutation Capabilities Between Time-Division Optical Omega Networks and Non-Optical Extra-Stage Omega Networks 518 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 9, NO. 4, AUGUST 2001 Equivalent Permutation Capabilities Between Time-Division Optical Omega Networks and Non-Optical Extra-Stage Omega Networks Xiaojun Shen,

More information

Study of Route Reconstruction Mechanism in DSDV Based Routing Protocols

Study of Route Reconstruction Mechanism in DSDV Based Routing Protocols Study of Route Reconstruction Mechanism in DSDV Based Routing Protocols Sharma Shelja, Kumar Suresh and Rathy R. K. Department of CSE, FET, MRIU, Faridabad, India Email: sharma.shelja@gmail.com, enthusk@yahoo.com,

More information

Metaheuristic Optimization with Evolver, Genocop and OptQuest

Metaheuristic Optimization with Evolver, Genocop and OptQuest Metaheuristic Optimization with Evolver, Genocop and OptQuest MANUEL LAGUNA Graduate School of Business Administration University of Colorado, Boulder, CO 80309-0419 Manuel.Laguna@Colorado.EDU Last revision:

More information

Lecture 24: Interconnection Networks. Topics: topologies, routing, deadlocks, flow control

Lecture 24: Interconnection Networks. Topics: topologies, routing, deadlocks, flow control Lecture 24: Interconnection Networks Topics: topologies, routing, deadlocks, flow control 1 Topology Examples Grid Torus Hypercube Criteria Bus Ring 2Dtorus 6-cube Fully connected Performance Bisection

More information

MANY experimental, and commercial multicomputers

MANY experimental, and commercial multicomputers 402 IEEE TRANSACTIONS ON RELIABILITY, VOL. 54, NO. 3, SEPTEMBER 2005 Optimal, and Reliable Communication in Hypercubes Using Extended Safety Vectors Jie Wu, Feng Gao, Zhongcheng Li, and Yinghua Min, Fellow,

More information

A Novel Task Scheduling Algorithm for Heterogeneous Computing

A Novel Task Scheduling Algorithm for Heterogeneous Computing A Novel Task Scheduling Algorithm for Heterogeneous Computing Vinay Kumar C. P.Katti P. C. Saxena SC&SS SC&SS SC&SS Jawaharlal Nehru University Jawaharlal Nehru University Jawaharlal Nehru University New

More information

4. Networks. in parallel computers. Advances in Computer Architecture

4. Networks. in parallel computers. Advances in Computer Architecture 4. Networks in parallel computers Advances in Computer Architecture System architectures for parallel computers Control organization Single Instruction stream Multiple Data stream (SIMD) All processors

More information

An Introduction to Management Science, 12e. Instructions for Using Excel 2007

An Introduction to Management Science, 12e. Instructions for Using Excel 2007 An Introduction to Management Science, 12e Instructions for Using Excel 2007 Appendix 12.2 Simulation Using Crystal Ball Pages 591 2: Defining and Entering Assumptions We are now ready to define the probability

More information

An Effective Neighborhood Initial-Playback Based Caching Scheme for Video on Demand over Mobile Ad Hoc Network

An Effective Neighborhood Initial-Playback Based Caching Scheme for Video on Demand over Mobile Ad Hoc Network An Effective Neighborhood Initial-Playback Based Caching Scheme for Video on Demand over Mobile Ad Hoc Network Saleh Ali Alomari, Member, IACSIT, Vaithegy Doraisamy, and Putra Sumari Abstract Video on

More information

2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006

2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,

More information

A limited-global information model for fault-tolerant routing in dual-cube

A limited-global information model for fault-tolerant routing in dual-cube The International Journal of Parallel, Emergent and Distributed Systems, Vol. 21, No. 1, February 2006, 61 77 A limited-global information model for fault-tolerant routing in dual-cube ZHEN JIANG * and

More information

Introduction. Introduction. Router Architectures. Introduction. Recent advances in routing architecture including

Introduction. Introduction. Router Architectures. Introduction. Recent advances in routing architecture including Router Architectures By the end of this lecture, you should be able to. Explain the different generations of router architectures Describe the route lookup process Explain the operation of PATRICIA algorithm

More information

Risk Assessment of a LM117 Voltage Regulator Circuit Design Using Crystal Ball and Minitab (Part 1) By Andrew G. Bell

Risk Assessment of a LM117 Voltage Regulator Circuit Design Using Crystal Ball and Minitab (Part 1) By Andrew G. Bell Risk Assessment of a LM7 Voltage Regulator Circuit Design Using Crystal Ball and Minitab (Part ) By Andrew G. Bell 3 August, 2006 Table of Contents Executive Summary 2 Introduction. 3 Design Requirements.

More information

Design and Implementation of Multistage Interconnection Networks for SoC Networks

Design and Implementation of Multistage Interconnection Networks for SoC Networks International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.5, October 212 Design and Implementation of Multistage Interconnection Networks for SoC Networks Mahsa

More information

IMPROVING THE RELEVANCY OF DOCUMENT SEARCH USING THE MULTI-TERM ADJACENCY KEYWORD-ORDER MODEL

IMPROVING THE RELEVANCY OF DOCUMENT SEARCH USING THE MULTI-TERM ADJACENCY KEYWORD-ORDER MODEL IMPROVING THE RELEVANCY OF DOCUMENT SEARCH USING THE MULTI-TERM ADJACENCY KEYWORD-ORDER MODEL Lim Bee Huang 1, Vimala Balakrishnan 2, Ram Gopal Raj 3 1,2 Department of Information System, 3 Department

More information

A Proposal for a High Speed Multicast Switch Fabric Design

A Proposal for a High Speed Multicast Switch Fabric Design A Proposal for a High Speed Multicast Switch Fabric Design Cheng Li, R.Venkatesan and H.M.Heys Faculty of Engineering and Applied Science Memorial University of Newfoundland St. John s, NF, Canada AB X

More information

DUE to the high computational complexity and real-time

DUE to the high computational complexity and real-time IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 15, NO. 3, MARCH 2005 445 A Memory-Efficient Realization of Cyclic Convolution and Its Application to Discrete Cosine Transform Hun-Chen

More information

Generic Methodologies for Deadlock-Free Routing

Generic Methodologies for Deadlock-Free Routing Generic Methodologies for Deadlock-Free Routing Hyunmin Park Dharma P. Agrawal Department of Computer Engineering Electrical & Computer Engineering, Box 7911 Myongji University North Carolina State University

More information

Tasks Scheduling using Ant Colony Optimization

Tasks Scheduling using Ant Colony Optimization Journal of Computer Science 8 (8): 1314-1320, 2012 ISSN 1549-3636 2012 Science Publications Tasks Scheduling using Ant Colony Optimization 1 Umarani Srikanth G., 2 V. Uma Maheswari, 3.P. Shanthi and 4

More information

Fast Efficient Clustering Algorithm for Balanced Data

Fast Efficient Clustering Algorithm for Balanced Data Vol. 5, No. 6, 214 Fast Efficient Clustering Algorithm for Balanced Data Adel A. Sewisy Faculty of Computer and Information, Assiut University M. H. Marghny Faculty of Computer and Information, Assiut

More information

LEAST COST ROUTING ALGORITHM WITH THE STATE SPACE RELAXATION IN A CENTRALIZED NETWORK

LEAST COST ROUTING ALGORITHM WITH THE STATE SPACE RELAXATION IN A CENTRALIZED NETWORK VOL., NO., JUNE 08 ISSN 896608 00608 Asian Research Publishing Network (ARPN). All rights reserved. LEAST COST ROUTING ALGORITHM WITH THE STATE SPACE RELAXATION IN A CENTRALIZED NETWORK Y. J. Lee Department

More information

arxiv:cs/ v1 [cs.dl] 11 Feb 1999

arxiv:cs/ v1 [cs.dl] 11 Feb 1999 arxiv:cs/9902023v1 [cs.dl] 11 Feb 1999 A New Ranking Principle for Multimedia Information Retrieval Martin Wechsler, Peter Schäuble Eurospider Information Technology AG, Zürich www.eurospider.com Abstract

More information

HARNESSING CERTAINTY TO SPEED TASK-ALLOCATION ALGORITHMS FOR MULTI-ROBOT SYSTEMS

HARNESSING CERTAINTY TO SPEED TASK-ALLOCATION ALGORITHMS FOR MULTI-ROBOT SYSTEMS HARNESSING CERTAINTY TO SPEED TASK-ALLOCATION ALGORITHMS FOR MULTI-ROBOT SYSTEMS An Undergraduate Research Scholars Thesis by DENISE IRVIN Submitted to the Undergraduate Research Scholars program at Texas

More information

Advanced Parallel Architecture. Annalisa Massini /2017

Advanced Parallel Architecture. Annalisa Massini /2017 Advanced Parallel Architecture Annalisa Massini - 2016/2017 References Advanced Computer Architecture and Parallel Processing H. El-Rewini, M. Abd-El-Barr, John Wiley and Sons, 2005 Parallel computing

More information

International Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS)

International Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS) International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational

More information

FPGA Implementation of Optimized DES Encryption Algorithm on Spartan 3E

FPGA Implementation of Optimized DES Encryption Algorithm on Spartan 3E FPGA Implementation of Optimized DES Encryption Algorithm on Spartan 3E Amandeep Singh, Manu Bansal Abstract - Data Security is an important parameter for the industries. It can be achieved by Encryption

More information

CHANNEL SHARING SCHEME FOR CELLULAR NETWORKS USING MDDCA PROTOCOL IN WLAN

CHANNEL SHARING SCHEME FOR CELLULAR NETWORKS USING MDDCA PROTOCOL IN WLAN International Journal on Information Sciences and Computing, Vol. 5, No.1, January 2011 65 Abstract CHANNEL SHARING SCHEME FOR CELLULAR NETWORKS USING MDDCA PROTOCOL IN WLAN Jesu Jayarin P. 1, Ravi T.

More information

Simulation. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall

Simulation. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall Simulation Chapter 14 14-1 Chapter Topics The Monte Carlo Process Computer Simulation with Excel Spreadsheets Simulation of a Queuing System Continuous Probability Distributions Statistical Analysis of

More information

A Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks

A Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 6, DECEMBER 2000 747 A Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks Yuhong Zhu, George N. Rouskas, Member,

More information

Int. J. Advanced Networking and Applications 1430 Volume:03 Issue:06 Pages: (2012) ISSN :

Int. J. Advanced Networking and Applications 1430 Volume:03 Issue:06 Pages: (2012) ISSN : 1430 Binary Decision Diagrams and Its Variable Ordering for Disjoint Network Manoj Singhal Associate professor, Department of Information Technology, Accurate Institute of Management & Technology, Greater

More information

Nodes Energy Conserving Algorithms to prevent Partitioning in Wireless Sensor Networks

Nodes Energy Conserving Algorithms to prevent Partitioning in Wireless Sensor Networks IJCSNS International Journal of Computer Science and Network Security, VOL.17 No.9, September 2017 139 Nodes Energy Conserving Algorithms to prevent Partitioning in Wireless Sensor Networks MINA MAHDAVI

More information

Virtual Circuit Blocking Probabilities in an ATM Banyan Network with b b Switching Elements

Virtual Circuit Blocking Probabilities in an ATM Banyan Network with b b Switching Elements Proceedings of the Applied Telecommunication Symposium (part of Advanced Simulation Technologies Conference) Seattle, Washington, USA, April 22 26, 21 Virtual Circuit Blocking Probabilities in an ATM Banyan

More information

Node-Independent Spanning Trees in Gaussian Networks

Node-Independent Spanning Trees in Gaussian Networks 4 Int'l Conf. Par. and Dist. Proc. Tech. and Appl. PDPTA'16 Node-Independent Spanning Trees in Gaussian Networks Z. Hussain 1, B. AlBdaiwi 1, and A. Cerny 1 Computer Science Department, Kuwait University,

More information

Multi-Processor / Parallel Processing

Multi-Processor / Parallel Processing Parallel Processing: Multi-Processor / Parallel Processing Originally, the computer has been viewed as a sequential machine. Most computer programming languages require the programmer to specify algorithms

More information

Multiprocessor Interconnection Networks- Part Three

Multiprocessor Interconnection Networks- Part Three Babylon University College of Information Technology Software Department Multiprocessor Interconnection Networks- Part Three By The k-ary n-cube Networks The k-ary n-cube network is a radix k cube with

More information

Interconnection networks

Interconnection networks Interconnection networks When more than one processor needs to access a memory structure, interconnection networks are needed to route data from processors to memories (concurrent access to a shared memory

More information

Routability-Driven Bump Assignment for Chip-Package Co-Design

Routability-Driven Bump Assignment for Chip-Package Co-Design 1 Routability-Driven Bump Assignment for Chip-Package Co-Design Presenter: Hung-Ming Chen Outline 2 Introduction Motivation Previous works Our contributions Preliminary Problem formulation Bump assignment

More information

Interconnection topologies (cont.) [ ] In meshes and hypercubes, the average distance increases with the dth root of N.

Interconnection topologies (cont.) [ ] In meshes and hypercubes, the average distance increases with the dth root of N. Interconnection topologies (cont.) [ 10.4.4] In meshes and hypercubes, the average distance increases with the dth root of N. In a tree, the average distance grows only logarithmically. A simple tree structure,

More information

A Level-wise Priority Based Task Scheduling for Heterogeneous Systems

A Level-wise Priority Based Task Scheduling for Heterogeneous Systems International Journal of Information and Education Technology, Vol., No. 5, December A Level-wise Priority Based Task Scheduling for Heterogeneous Systems R. Eswari and S. Nickolas, Member IACSIT Abstract

More information

Lecture 12: Interconnection Networks. Topics: dimension/arity, routing, deadlock, flow control

Lecture 12: Interconnection Networks. Topics: dimension/arity, routing, deadlock, flow control Lecture 12: Interconnection Networks Topics: dimension/arity, routing, deadlock, flow control 1 Interconnection Networks Recall: fully connected network, arrays/rings, meshes/tori, trees, butterflies,

More information

Data Hiding on Text Using Big-5 Code

Data Hiding on Text Using Big-5 Code Data Hiding on Text Using Big-5 Code Jun-Chou Chuang 1 and Yu-Chen Hu 2 1 Department of Computer Science and Communication Engineering Providence University 200 Chung-Chi Rd., Shalu, Taichung 43301, Republic

More information

Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions

Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions R.Thamaraiselvan 1, S.Gopikrishnan 2, V.Pavithra Devi 3 PG Student, Computer Science & Engineering, Paavai College

More information

Design of Optical Burst Switches based on Dual Shuffle-exchange Network and Deflection Routing

Design of Optical Burst Switches based on Dual Shuffle-exchange Network and Deflection Routing Design of Optical Burst Switches based on Dual Shuffle-exchange Network and Deflection Routing Man-Ting Choy Department of Information Engineering, The Chinese University of Hong Kong mtchoy1@ie.cuhk.edu.hk

More information

A New Pool Control Method for Boolean Compressed Sensing Based Adaptive Group Testing

A New Pool Control Method for Boolean Compressed Sensing Based Adaptive Group Testing Proceedings of APSIPA Annual Summit and Conference 27 2-5 December 27, Malaysia A New Pool Control Method for Boolean Compressed Sensing Based Adaptive roup Testing Yujia Lu and Kazunori Hayashi raduate

More information

Mitigating Data Skew Using Map Reduce Application

Mitigating Data Skew Using Map Reduce Application Ms. Archana P.M Mitigating Data Skew Using Map Reduce Application Mr. Malathesh S.H 4 th sem, M.Tech (C.S.E) Associate Professor C.S.E Dept. M.S.E.C, V.T.U Bangalore, India archanaanil062@gmail.com M.S.E.C,

More information

Complementary Graph Coloring

Complementary Graph Coloring International Journal of Computer (IJC) ISSN 2307-4523 (Print & Online) Global Society of Scientific Research and Researchers http://ijcjournal.org/ Complementary Graph Coloring Mohamed Al-Ibrahim a*,

More information

STATIC SCHEDULING FOR CYCLO STATIC DATA FLOW GRAPHS

STATIC SCHEDULING FOR CYCLO STATIC DATA FLOW GRAPHS STATIC SCHEDULING FOR CYCLO STATIC DATA FLOW GRAPHS Sukumar Reddy Anapalli Krishna Chaithanya Chakilam Timothy W. O Neil Dept. of Computer Science Dept. of Computer Science Dept. of Computer Science The

More information

Scalability and Classifications

Scalability and Classifications Scalability and Classifications 1 Types of Parallel Computers MIMD and SIMD classifications shared and distributed memory multicomputers distributed shared memory computers 2 Network Topologies static

More information

Task Scheduling Using Probabilistic Ant Colony Heuristics

Task Scheduling Using Probabilistic Ant Colony Heuristics The International Arab Journal of Information Technology, Vol. 13, No. 4, July 2016 375 Task Scheduling Using Probabilistic Ant Colony Heuristics Umarani Srikanth 1, Uma Maheswari 2, Shanthi Palaniswami

More information

Outline. Distributed Shared Memory. Shared Memory. ECE574 Cluster Computing. Dichotomy of Parallel Computing Platforms (Continued)

Outline. Distributed Shared Memory. Shared Memory. ECE574 Cluster Computing. Dichotomy of Parallel Computing Platforms (Continued) Cluster Computing Dichotomy of Parallel Computing Platforms (Continued) Lecturer: Dr Yifeng Zhu Class Review Interconnections Crossbar» Example: myrinet Multistage» Example: Omega network Outline Flynn

More information

Generic Graphics for Uncertainty and Sensitivity Analysis

Generic Graphics for Uncertainty and Sensitivity Analysis Generic Graphics for Uncertainty and Sensitivity Analysis R. M. Cooke Dept. Mathematics, TU Delft, The Netherlands J. M. van Noortwijk HKV Consultants, Lelystad, The Netherlands ABSTRACT: We discuss graphical

More information

Measuring the Vulnerability of Interconnection. Networks in Embedded Systems. University of Massachusetts, Amherst, MA 01003

Measuring the Vulnerability of Interconnection. Networks in Embedded Systems. University of Massachusetts, Amherst, MA 01003 Measuring the Vulnerability o Interconnection Networks in Embedded Systems V. Lakamraju, Z. Koren, I. Koren, and C. M. Krishna Department o Electrical and Computer Engineering University o Massachusetts,

More information

A Performance Study of Parallel FFT in Clos and Mesh Networks

A Performance Study of Parallel FFT in Clos and Mesh Networks A Performance Study of Parallel FFT in Clos and Mesh Networks Rajkumar Kettimuthu 1 and Sankara Muthukrishnan 2 1 Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439,

More information

A Transaction Processing Technique in Real-Time Object- Oriented Databases

A Transaction Processing Technique in Real-Time Object- Oriented Databases 122 IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.1, January 2008 A Transaction Processing Technique in Real-Time Object- Oriented Databases Woochun Jun Dept. of Computer

More information

Lecture: Interconnection Networks. Topics: TM wrap-up, routing, deadlock, flow control, virtual channels

Lecture: Interconnection Networks. Topics: TM wrap-up, routing, deadlock, flow control, virtual channels Lecture: Interconnection Networks Topics: TM wrap-up, routing, deadlock, flow control, virtual channels 1 TM wrap-up Eager versioning: create a log of old values Handling problematic situations with a

More information

/$ IEEE

/$ IEEE IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 56, NO. 1, JANUARY 2009 81 Bit-Level Extrinsic Information Exchange Method for Double-Binary Turbo Codes Ji-Hoon Kim, Student Member,

More information

The K-Ring: a versatile model for the design of MIMD computer topology

The K-Ring: a versatile model for the design of MIMD computer topology The K-Ring: a versatile model for the design of MIMD computer topology P. Kuonen Computer Science Department Swiss Federal Institute of Technology CH-115 Lausanne, Switzerland E-mail: Pierre.Kuonen@epfl.ch

More information

Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks

Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks X. Yuan, R. Melhem and R. Gupta Department of Computer Science University of Pittsburgh Pittsburgh, PA 156 fxyuan,

More information

Data Communication and Parallel Computing on Twisted Hypercubes

Data Communication and Parallel Computing on Twisted Hypercubes Data Communication and Parallel Computing on Twisted Hypercubes E. Abuelrub, Department of Computer Science, Zarqa Private University, Jordan Abstract- Massively parallel distributed-memory architectures

More information

An Energy Efficient Coverage Method for Clustered Wireless Sensor Networks

An Energy Efficient Coverage Method for Clustered Wireless Sensor Networks An Energy Efficient Coverage Method for Clustered Wireless Sensor Networks J. Shanbehzadeh, M. Mehrani, A. Sarrafzadeh, and Z. Razaghi Abstract an important issue in WSN is the regional covering. A coverage

More information

Splitting of traffic to maximize the data transmission in mobile ad hoc network under different constraints

Splitting of traffic to maximize the data transmission in mobile ad hoc network under different constraints www.ijcsi.org 558 Splitting of traffic to maximize the data transmission in mobile ad hoc network under different constraints Sushil Chandra Dimri 1, Kamlesh Chandra Purohit 2 and Durgesh Pant 1 Graphic

More information

INSTRUCTIONS FOR TYPESETTING MANUSCRIPTS USING L A TEX

INSTRUCTIONS FOR TYPESETTING MANUSCRIPTS USING L A TEX International Journal of Modern Physics B c World Scientific Publishing Company INSTRUCTIONS FOR TYPESETTING MANUSCRIPTS USING L A TEX FIRST AUTHOR University Department, University Name, Address City,

More information

A Low-Cost Correction Algorithm for Transient Data Errors

A Low-Cost Correction Algorithm for Transient Data Errors A Low-Cost Correction Algorithm for Transient Data Errors Aiguo Li, Bingrong Hong School of Computer Science and Technology Harbin Institute of Technology, Harbin 150001, China liaiguo@hit.edu.cn Introduction

More information

PROBLEM SOLVING AND OFFICE AUTOMATION. A Program consists of a series of instruction that a computer processes to perform the required operation.

PROBLEM SOLVING AND OFFICE AUTOMATION. A Program consists of a series of instruction that a computer processes to perform the required operation. UNIT III PROBLEM SOLVING AND OFFICE AUTOMATION Planning the Computer Program Purpose Algorithm Flow Charts Pseudo code -Application Software Packages- Introduction to Office Packages (not detailed commands

More information

Meshlization of Irregular Grid Resource Topologies by Heuristic Square-Packing Methods

Meshlization of Irregular Grid Resource Topologies by Heuristic Square-Packing Methods Meshlization of Irregular Grid Resource Topologies by Heuristic Square-Packing Methods Uei-Ren Chen 1, Chin-Chi Wu 2, and Woei Lin 3 1 Department of Electronic Engineering, Hsiuping Institute of Technology

More information

An Efficient Decoding Technique for Huffman Codes Abstract 1. Introduction

An Efficient Decoding Technique for Huffman Codes Abstract 1. Introduction An Efficient Decoding Technique for Huffman Codes Rezaul Alam Chowdhury and M. Kaykobad Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka-1000, Bangladesh,

More information

METHODOLOGY FOR SOLVING TWO-SIDED ASSEMBLY LINE BALANCING IN SPREADSHEET

METHODOLOGY FOR SOLVING TWO-SIDED ASSEMBLY LINE BALANCING IN SPREADSHEET METHODOLOGY FOR SOLVING TWO-SIDED ASSEMBLY LINE BALANCING IN SPREADSHEET Salleh Ahmad Bareduan and Salem Abdulsalam Elteriki Department of Manufacturing and Industrial Engineering, University Tun Hussein

More information

MOTIVATION TO OPTICAL MULTISTAGE INTERCONNECTION NETWORKS

MOTIVATION TO OPTICAL MULTISTAGE INTERCONNECTION NETWORKS MOTIVATION TO OPTICAL MULTISTAGE INTERCONNECTION NETWORKS 1 SindhuLakshmi Manchikanti, 2 Gayathri Korrapati 1 Department of Computer Science, Sree Vidyanikethan Institute of Management, Tirupathi, A.Rangampet-517102,

More information

An analysis of retransmission strategies for reliable multicast protocols

An analysis of retransmission strategies for reliable multicast protocols An analysis of retransmission strategies for reliable multicast protocols M. Schuba, P. Reichl Informatik 4, Aachen University of Technology 52056 Aachen, Germany email: marko peter@i4.informatik.rwth-aachen.de

More information

On Universal Cycles of Labeled Graphs

On Universal Cycles of Labeled Graphs On Universal Cycles of Labeled Graphs Greg Brockman Harvard University Cambridge, MA 02138 United States brockman@hcs.harvard.edu Bill Kay University of South Carolina Columbia, SC 29208 United States

More information

EE/CSCI 451: Parallel and Distributed Computation

EE/CSCI 451: Parallel and Distributed Computation EE/CSCI 451: Parallel and Distributed Computation Lecture #4 1/24/2018 Xuehai Qian xuehai.qian@usc.edu http://alchem.usc.edu/portal/xuehaiq.html University of Southern California 1 Announcements PA #1

More information

Parallel-computing approach for FFT implementation on digital signal processor (DSP)

Parallel-computing approach for FFT implementation on digital signal processor (DSP) Parallel-computing approach for FFT implementation on digital signal processor (DSP) Yi-Pin Hsu and Shin-Yu Lin Abstract An efficient parallel form in digital signal processor can improve the algorithm

More information

The Assignment Problem: Exploring Parallelism

The Assignment Problem: Exploring Parallelism The Assignment Problem: Exploring Parallelism Timothy J Rolfe Department of Computer Science Eastern Washington University 319F Computing & Engineering Bldg. Cheney, Washington 99004-2493 USA Timothy.Rolfe@mail.ewu.edu

More information

Identifying Stepping Stone Attack using Trace Back Based Detection Approach

Identifying Stepping Stone Attack using Trace Back Based Detection Approach International Journal of Security Technology for Smart Device Vol.3, No.1 (2016), pp.15-20 http://dx.doi.org/10.21742/ijstsd.2016.3.1.03 Identifying Stepping Stone Attack using Trace Back Based Detection

More information