Measuring the Vulnerability of Interconnection. Networks in Embedded Systems. University of Massachusetts, Amherst, MA 01003
|
|
- Thomasina Campbell
- 5 years ago
- Views:
Transcription
1 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, Amherst, MA Abstract. Studies o the ault-tolerance o graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little inormation or designers to use in selecting a suitable topology or the interconnection network in embedded systems. In this paper, we study the vulnerability o interconnection networks to the ailure o individual links, using a set o our measures which, taken together, provide a much uller characterization o the network. Moreover, while traditional studies typically limit themselves to uncorrelated link ailures, our model deals with both uncorrelated and correlated ailure modes. This is o practical signicance, since quite oten, ailures in networks are correlated due to physical considerations. 1 Introduction The interconnection network is an integral part o most embedded systems. It has oten as considerable an impact on the system's perormance as the nodes themselves. The choice o an appropriate interconnection network is thereore key to determining the perormance o the embedded system. Perormance measures or interconnection networks are essential to guide the designer in choosing an appropriate topology. In large systems { especially those which must operate or long durations without any possibility o repair { the probability is signicant that one or more nodes and/or links are down at any time and this can aect the perormance o the system considerably. Studies o the ault-tolerance o networks have tended to largely concentrate on measures such as classical node (link) connectivity. They measure the extent to which the network can withstand the ailure o individual links and nodes while still remaining unctional. Such measures are very basic and limited in what they can express o reliability (see [4] or a survey o measures o network vulnerability). They are worst-case measures and convey very little inormation or designers to use in selecting a suitable topology or the interconnection network in embedded systems. In this paper we study the vulnerability o an interconnection network to the ailure o individual links, using a set o our measures which, taken together, provide a much uller characterization o the network. Moreover, while traditional studies typically limit themselves to independent link ailures, our studies deal with correlated ailure modes, as well. We start in Section 2 by dening our measures o network vulnerability. We ollow this in Section 3 with some numerical results. A brie discussion in Section 4 concludes the paper.
2 2 The Perormance Measures The our perormance metrics used to assess network vulnerability can be grouped into two pairs. The rst pair assesses the tendency o the topology under study to become disconnected due to link ailures. The two measures under this category are: { 1. The probability that the network becomes disconnected, d. { 2. The size o the biggest connected component, max. The probability that the network becomes disconnected gives us guidance as to the chance that all the processors remain usable (assuming the processors themselves do not ail) by being reachable rom every other processor. I the network does get disconnected, we are interested in what happens to the splinters that are let. In particular, we are concerned with whether the graph breaks up into a large number o small components, or whether there is one large component which contains most o the nodes. The latter is obviously preerable. All other things being equal, thereore, we would preer a network which would disconnect in such a way that the biggest component let ater disconnection contains a large raction o the nodes. The second pair o measures ocuses on node-pair distances. They are: { 3. The diameter o the network,. { 4. The average distance between node pairs, D. Node pair distances play a role in determining the time it takes or messages to be sent rom one node to another. A graph whose diameter is relatively stable is obviously superior to another whose diameter exhibits rapid variations upon link ailure. The notion o diameter stability is not new: the previously-dened measure o edge persistence [3] is the minimum number o edges that must be removed to increase the graph diameter. Persistence, however, being a worst-case measure, conveys much less inormation about graph vulnerability than does the diameter, as a unction o the component ailure probability. Inter-node distances play a large role in determining the communication delays between nodes. Algorithms that assign tasks to nodes (processors) have to account or inter-node communication delays when dealing with tasks which communicate with one another. The smaller the delays between the nodes, the greater are the options available to the task assignment algorithm. This is especially true when the original task assignment (on a computer without any ailures) is sought to be done in such away that any task reassignment required upon ailure is reduced. For hard real-time systems, it becomes important that the system state on the ailed node be transerred to another node with very little delay. This parameter gives a good estimate o the amount o delay that would be involved in the movement o data that would be required to re-establish the state. A close estimation o such delays can help in the ecient calculation o ault-recovery policies[2]. It also gives an indication o how closely the nodes are connected to each other and this can help in the scheduling o tasks. 3 Simulation Models and Results We consider two link ailure models: uniorm and clustered. In the uniorm model, link ailures ollow an IID (independent and identically distributed) stochastic process. Each link ails with probability p, and link ailures are independent o one another. In the clustered model, a probability o either p, or p + (or some given p, ) is randomly selected or each node. Each link incident on a node ails with the ailure probability drawn or that node. This ailure mechanism results in adjacent links being correlated
3 with regard to aults, and consequently, in bigger clusters o aulty links and o ault-ree links than those generated by the IID link ailures. is the clustering parameter. The greater the value o, the more clustered the ailing links will be. Note that since the ailure probability is applied twice to the same link, the actual probability o a random link ailure in the correlated model is p =1, (1, p) 2. Three dierent classes o topologies have been used or the simulation runs, namely, the mesh, the hypercube and the generalization o a chordal ring proposed by Arden and Lee[1]. This is a chordal ring in which extra links are added (apart rom the 2 links connected to each o its neighbors) among the nodes in some regular ashion. The exact placement o these extra links has an impact on both the traditional measures as well as the ones proposed here. All the simulation runs were on networks o 64 nodes. Some o the networks had degree 4 and the rest degree 6. A simple rectangular mesh as well as its counterpart, the mesh torus (a mesh with an end-around connection) and both 2-D and 3-D meshes were tested. Simulation runs were perormed to measure the eect o the link ailure probability, p,aswell as the the eect o the clustering parameter,, on the dierent perormance measures, or the mentioned graph amilies. A number o interesting results can be concluded rom the plots. Figures 1, 2, 3 and 4 depict the dependence on the link ailure probability p (in the IID link ailure model) o the probability o network disconnection d, the maximum component size max, the diameter, and the average node-pair distance D, respectively, or the dierent topologies. The conclusions we can derive rom these gures are as ollows. Though the rectangular mesh is the topology o choice when scalability is concerned, it is certainly not the best topology when considering resistance to link ailures. The probability that the network becomes disconnected increases rapidly as the probability o link ailure increases. The other topologies in its class do better in all the other parameters as well. Similarly, among the degree-6 networks, the 3-D mesh perorms very badly compared to the other topologies in its class. The chordal ring o degree 4 has better diameter stability compared to the mesh torus. One word o caution though: The diameter o the chordal ring depends on the placement o the extra links (i.e. not those connected to immediate neighbors). For the simulations, an extensive search was perormed to nd a placement o links which would result in the minimum diameter. The chordal ring o degree 6 perorms only marginally better than the hypercube and the 3-D mesh torus in the diameter and average distance measures. Figures 5 and 6 show the dependence o the probability o network disconnection, d, and that o the maximum component size, max, respectively, on the ault clustering parameter,, or several graph topologies. The incidence o disconnected graphs increases with the ailure clustering (even though the link ailure probability remains the same). Again, the meshes without the end-around connection perorm badly compared to the other networks. Each amily o graphs has a distinctive sensitivity to the level o ailure clustering. The size o the largest connected component decreases as the degree o clustering increases. Also, the maximum component size is dependent on the clustering o links in the topology. This is illustrated in Figure 6 with the two types o the chordal ring. The good placement reers to an optimal placement o the links whereas bad placement reers to a sub-optimal placement. The dependence o the extra link placement on the component size becomes negligible as the degree o the network increases. Our experiments also showed that the two other measures, namely, the diameter and the
4 average node-pair distance (in graphs that remain connected) are not very sensitive to the ailure clustering, with the diameter being slightly more sensitive than the average distance. This result holds across graph amilies. 4 Discussion In this paper, we have studied the vulnerability o various topologies to link ailure. These results { and others like them { can be used by designers in choosing the appropriate topology. We have conned ourselves to a set o symmetric networks: we plan to extend our studies to irregular topologies. There is also room or modeling correlated ailures in other ways. One o them would be to use a \wave-propagation" model, in which the eect o the correlated ailure at a node ripples through the network so that all the links which are at the same distance rom the ailed node has the same probability o ailure and this probability decreases as the distance increases. It would also be interesting to look at the combined eect o both node and link ailures. Acknowledgment This eort was supported in part by the Deense Advanced Research Projects Agency and the Air Force Research Laboratory, Air Force Materiel Command, USAF, under agreement number F , order E349. The government is authorized to reproduce and distribute reprints or Governmental purposes notwithstanding any copyright annotation thereon. The views and conclusions contained herein are those o the authors and should not be interpreted as necessarily representing the ocial policies or endorsements, either expressed or implied, or the Deense Advanced Projects Agency, Air Force Research Laboratory, or the U. S. Government. Reerences 1. B.W.Arden and H.Lee. \Analysis o Chordal Ring Networks", IEEE Transactions on Computers C-30, M.Berg and I. Koren, \On Switching Policies or Modular Fault-Tolerant Computing Systems", IEEE Transactions on Computers Vol. C-36, F. T. Boesch, F. Harary, J. A. Kabell, \Graphs as Models o Communication Network Vulnerability: Connectivity and Persistence," Networks, Vol. 11, M.Choi and C.M.Krishna, \On Measures o Vulnerability o Interconnection Networks", Microelectronics and Reliability Vol 29, No. 6, T.Cormen, C. Leiserson and R.Rivest, Introduction to Algorithms, Cambridge: MIT Press, C. M. Krishna and K. G. Shin, Real-Time Systems, New York: McGraw-Hill, This article was processed using the LaT E X macro package with LLNCS style
5 π d Probability o network disconnection torus torus Fig. 1. Network disconnection probability versus p Maximum component size χ Diameter max torus torus Fig. 2. Maximum component size versus p torus torus Fig. 3. Diameter versus p
6 Average node-pair distance D torus torus Fig. 4. Average node-pair distance verus p Probability o network disconnection torus π d δ clustering parameter Fig. 5. Network disconnection probability versus ; p =0: Maximum component size χ max torus 64-node chordal ring; degree 4; good link placement 64-node chordal ring; degree 4; bad link placement δ clustering parameter Fig. 6. Maximum component size versus ; p =0:1
6% Writes. 4% Writes. 2% Writes. D e g r e e o f R e p l i c a t i o n
Power-Aware Replication of Data Structures in Distributed Embedded Real-Time Systems? Osman S. Unsal, Israel Koren, C. Mani Krishna Department of Electrical and Computer Engineering University of Massachusetts,
More informationMATRIX ALGORITHM OF SOLVING GRAPH CUTTING PROBLEM
UDC 681.3.06 MATRIX ALGORITHM OF SOLVING GRAPH CUTTING PROBLEM V.K. Pogrebnoy TPU Institute «Cybernetic centre» E-mail: vk@ad.cctpu.edu.ru Matrix algorithm o solving graph cutting problem has been suggested.
More information3.1. Generating Random Regular Networks The Filtering Process
Synthesis of Interconnection Networks: A Novel Approach Vijay Lakamraju, Israel Koren and C.M. Krishna Department of lectrical and Computer ngineering University of Massachusetts, Amherst -mail: fvlakamra,koren,krishnag@ecs.umass.edu
More informationPreliminary results from an agent-based adaptation of friendship games
Preliminary results from an agent-based adaptation of friendship games David S. Dixon June 29, 2011 This paper presents agent-based model (ABM) equivalents of friendshipbased games and compares the results
More informationDepartment of. Computer Science. A Genetic Algorithm Tutorial. Darrell Whitley. (Revised) November 10, Colorado State University
Department o Computer Science A Genetic Algorithm Tutorial Darrell Whitley Technical Report CS-93-103 (Revised) November 10, 1993 Colorado State University A Genetic Algorithm Tutorial Darrell Whitley
More information2. Design Planning with the Quartus II Software
November 2013 QII51016-13.1.0 2. Design Planning with the Quartus II Sotware QII51016-13.1.0 This chapter discusses key FPGA design planning considerations, provides recommendations, and describes various
More informationReflection and Refraction
Relection and Reraction Object To determine ocal lengths o lenses and mirrors and to determine the index o reraction o glass. Apparatus Lenses, optical bench, mirrors, light source, screen, plastic or
More informationConstructive floorplanning with a yield objective
Constructive floorplanning with a yield objective Rajnish Prasad and Israel Koren Department of Electrical and Computer Engineering University of Massachusetts, Amherst, MA 13 E-mail: rprasad,koren@ecs.umass.edu
More informationParametric and provisioning approaches are again obviously useful for various
Parametric and provisioning approaches are again obviously useful for various kinds of generic descriptions and provide the most direct means of deriving their product architecture from the product line
More informationMethod estimating reflection coefficients of adaptive lattice filter and its application to system identification
Acoust. Sci. & Tech. 28, 2 (27) PAPER #27 The Acoustical Society o Japan Method estimating relection coeicients o adaptive lattice ilter and its application to system identiication Kensaku Fujii 1;, Masaaki
More informationEcient Processor Allocation for 3D Tori. Wenjian Qiao and Lionel M. Ni. Department of Computer Science. Michigan State University
Ecient Processor llocation for D ori Wenjian Qiao and Lionel M. Ni Department of Computer Science Michigan State University East Lansing, MI 4884-107 fqiaow, nig@cps.msu.edu bstract Ecient allocation of
More informationMultiprocessor 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 informationA Small-world Network Where All Nodes Have the Same Connectivity, with Application to the Dynamics of Boolean Interacting Automata
A Small-world Network Where All Nodes Have the Same Connectivity, with Application to the Dynamics o Boolean Interacting Automata Roberto Serra Department o Statistics, Ca Foscari University, Fondamenta
More informationPerformance Assessment of Wavelength Routing Optical Networks with Regular Degree-Three Topologies of Minimum Diameter
Performance Assessment of Wavelength Routing Optical Networks with Regular Degree-Three Topologies of Minimum Diameter RUI M. F. COELHO 1, JOEL J. P. C. RODRIGUES 2, AND MÁRIO M. FREIRE 2 1 Superior Scholl
More informationAn Evaluation of Information Retrieval Accuracy. with Simulated OCR Output. K. Taghva z, and J. Borsack z. University of Massachusetts, Amherst
An Evaluation of Information Retrieval Accuracy with Simulated OCR Output W.B. Croft y, S.M. Harding y, K. Taghva z, and J. Borsack z y Computer Science Department University of Massachusetts, Amherst
More informationOn characterizing BGP routing table growth
University of Massachusetts Amherst From the SelectedWorks of Lixin Gao 00 On characterizing BGP routing table growth T Bu LX Gao D Towsley Available at: https://works.bepress.com/lixin_gao/66/ On Characterizing
More information9.8 Graphing Rational Functions
9. Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm P where P and Q are polynomials. Q An eample o a simple rational unction
More informationA Fault Model Centered Modeling Framework for Self-healing Computing Systems
A Fault Model Centered Modeling Framework or Sel-healing Computing Systems Wei Lu 1, Yian Zhu 1, Chunyan Ma 1, and Longmei Zhang 2 1 Department o Sotware and Microelectronics, Northwestern Polytechnical
More information13. Power Optimization
13. Power Optimization May 2013 QII52016-13.0.0 QII52016-13.0.0 The Quartus II sotware oers power-driven compilation to ully optimize device power consumption. Power-driven compilation ocuses on reducing
More informationOn-line Estimation of Power System Security Limits
Bulk Power System Dynamics and Control V, August 26-31, 2001, Onomichi, Japan On-line Estimation of Power System Security Limits K. Tomsovic A. Sittithumwat J. Tong School of Electrical Engineering and
More informationRegenerating Codes for Errors and Erasures in Distributed Storage
Regenerating Codes or Errors and Erasures in Distributed Storage K V Rashmi, Nihar B Shah, Kannan Ramchandran, Fellow, IEEE, and P Vijay Kumar, Fellow, IEEE arxiv:0050v csit] 3 May 0 Abstract Regenerating
More informationITU - Telecommunication Standardization Sector. G.fast: Far-end crosstalk in twisted pair cabling; measurements and modelling ABSTRACT
ITU - Telecommunication Standardization Sector STUDY GROUP 15 Temporary Document 11RV-22 Original: English Richmond, VA. - 3-1 Nov. 211 Question: 4/15 SOURCE 1 : TNO TITLE: G.ast: Far-end crosstalk in
More informationTechnische Universitat Munchen. Institut fur Informatik. D Munchen.
Developing Applications for Multicomputer Systems on Workstation Clusters Georg Stellner, Arndt Bode, Stefan Lamberts and Thomas Ludwig? Technische Universitat Munchen Institut fur Informatik Lehrstuhl
More informationExtra-High Speed Matrix Multiplication on the Cray-2. David H. Bailey. September 2, 1987
Extra-High Speed Matrix Multiplication on the Cray-2 David H. Bailey September 2, 1987 Ref: SIAM J. on Scientic and Statistical Computing, vol. 9, no. 3, (May 1988), pg. 603{607 Abstract The Cray-2 is
More informationINTERCONNECTION NETWORKS LECTURE 4
INTERCONNECTION NETWORKS LECTURE 4 DR. SAMMAN H. AMEEN 1 Topology Specifies way switches are wired Affects routing, reliability, throughput, latency, building ease Routing How does a message get from source
More informationChapter 2 Mobility Model Characteristics
Chapter 2 Mobility Model Characteristics Abstract The salient characteristics of mobility models of mobile nodes in mobile ad hoc networks are described. We have described how the different mobility models
More informationAn Agent-Based Adaptation of Friendship Games: Observations on Network Topologies
An Agent-Based Adaptation of Friendship Games: Observations on Network Topologies David S. Dixon University of New Mexico, Albuquerque NM 87131, USA Abstract. A friendship game in game theory is a network
More informationWhat is Clustering? Clustering. Characterizing Cluster Methods. Clusters. Cluster Validity. Basic Clustering Methodology
Clustering Unsupervised learning Generating classes Distance/similarity measures Agglomerative methods Divisive methods Data Clustering 1 What is Clustering? Form o unsupervised learning - no inormation
More informationAn Approach for Performance Evaluation of Batch-sequential and Parallel Architectural Styles
An Approach or Perormance Evaluation o Batch-sequential and Parallel Architectural Styles Golnaz Aghaee Ghazvini MSc student, Young Research Club, Njaabad Branch, Esahan, Iran Aghaee.golnaz@sco.iaun.ac.ir
More information2. Recommended Design Flow
2. Recommended Design Flow This chapter describes the Altera-recommended design low or successully implementing external memory interaces in Altera devices. Altera recommends that you create an example
More informationUsing a Projected Subgradient Method to Solve a Constrained Optimization Problem for Separating an Arbitrary Set of Points into Uniform Segments
Using a Projected Subgradient Method to Solve a Constrained Optimization Problem or Separating an Arbitrary Set o Points into Uniorm Segments Michael Johnson May 31, 2011 1 Background Inormation The Airborne
More informationOptimal Topology for Distributed Shared-Memory. Multiprocessors: Hypercubes Again? Jose Duato and M.P. Malumbres
Optimal Topology for Distributed Shared-Memory Multiprocessors: Hypercubes Again? Jose Duato and M.P. Malumbres Facultad de Informatica, Universidad Politecnica de Valencia P.O.B. 22012, 46071 - Valencia,
More informationInfluence of Chord Length on the Blocking Performance of Wavelength Routed Chordal Ring Networks
Influence of Chord Length on the Blocking Performance of Wavelength Routed Chordal Ring Networks MARIO M. FREIRE! AND HENRIQUE 1. A. DA SIL VA2 1 Department of Computer Science, University of Be ira Interior
More informationwhere ~n = ( ) t is the normal o the plane (ie, Q ~ t ~n =,8 Q ~ ), =( ~ X Y Z ) t and ~t = (t X t Y t Z ) t are the camera rotation and translation,
Multi-Frame Alignment o Planes Lihi Zelnik-Manor Michal Irani Dept o Computer Science and Applied Math The Weizmann Institute o Science Rehovot, Israel Abstract Traditional plane alignment techniques are
More information/$10.00 (c) 1998 IEEE
Dual Busy Tone Multiple Access (DBTMA) - Performance Results Zygmunt J. Haas and Jing Deng School of Electrical Engineering Frank Rhodes Hall Cornell University Ithaca, NY 85 E-mail: haas, jing@ee.cornell.edu
More informationNode-Disjoint Paths in Hierarchical Hypercube Networks
Node-Disjoint aths in Hierarchical Hypercube Networks Ruei-Yu Wu 1,GerardJ.Chang 2,Gen-HueyChen 1 1 National Taiwan University 2 National Taiwan University Dept. of Computer Science and Information Engineering
More informationImplementations of Dijkstra's Algorithm. Based on Multi-Level Buckets. November Abstract
Implementations of Dijkstra's Algorithm Based on Multi-Level Buckets Andrew V. Goldberg NEC Research Institute 4 Independence Way Princeton, NJ 08540 avg@research.nj.nec.com Craig Silverstein Computer
More informationr1 i3 n3 r4 n4 r2 r3 h2 i2
Routing Inormation Protocol in HOL/SPIN Karthikeyan Bhargavan, Carl A. Gunter, and Davor Obradovic? University o Pennsylvania Abstract. We provide a proo using HOL and SPIN o convergence or the Routing
More informationAdvanced 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 informationConnectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks
Connectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks Fatiha Djemili Tolba University of Haute Alsace GRTC Colmar, France fatiha.tolba@uha.fr Damien Magoni University
More informationInterconnection 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 informationNetwork Survivability
Network Survivability Bernard Cousin Outline Introduction to Network Survivability Types of Network Failures Reliability Requirements and Schemes Principles of Network Recovery Performance of Recovery
More informationSolving Traveling Salesman Problem Using Parallel Genetic. Algorithm and Simulated Annealing
Solving Traveling Salesman Problem Using Parallel Genetic Algorithm and Simulated Annealing Fan Yang May 18, 2010 Abstract The traveling salesman problem (TSP) is to find a tour of a given number of cities
More informationNon-Uniform Memory Access (NUMA) Architecture and Multicomputers
Non-Uniform Memory Access (NUMA) Architecture and Multicomputers Parallel and Distributed Computing Department of Computer Science and Engineering (DEI) Instituto Superior Técnico February 29, 2016 CPD
More informationAvailability of Coding Based Replication Schemes. Gagan Agrawal. University of Maryland. College Park, MD 20742
Availability of Coding Based Replication Schemes Gagan Agrawal Department of Computer Science University of Maryland College Park, MD 20742 Abstract Data is often replicated in distributed systems to improve
More informationConcavity. Notice the location of the tangents to each type of curve.
Concavity We ve seen how knowing where a unction is increasing and decreasing gives a us a good sense o the shape o its graph We can reine that sense o shape by determining which way the unction bends
More informationPerformance 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 informationConsistent Logical Checkpointing. Nitin H. Vaidya. Texas A&M University. Phone: Fax:
Consistent Logical Checkpointing Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, TX 77843-3112 hone: 409-845-0512 Fax: 409-847-8578 E-mail: vaidya@cs.tamu.edu Technical
More information9. Reviewing Printed Circuit Board Schematics with the Quartus II Software
November 2012 QII52019-12.1.0 9. Reviewing Printed Circuit Board Schematics with the Quartus II Sotware QII52019-12.1.0 This chapter provides guidelines or reviewing printed circuit board (PCB) schematics
More informationTHE FINANCIAL CALCULATOR
Starter Kit CHAPTER 3 Stalla Seminars THE FINANCIAL CALCULATOR In accordance with the AIMR calculator policy in eect at the time o this writing, CFA candidates are permitted to use one o two approved calculators
More informationNeighbourhood Operations
Neighbourhood Operations Neighbourhood operations simply operate on a larger neighbourhood o piels than point operations Origin Neighbourhoods are mostly a rectangle around a central piel Any size rectangle
More informationNon-Uniform Memory Access (NUMA) Architecture and Multicomputers
Non-Uniform Memory Access (NUMA) Architecture and Multicomputers Parallel and Distributed Computing Department of Computer Science and Engineering (DEI) Instituto Superior Técnico September 26, 2011 CPD
More informationReliability Analysis of Gamma Interconnection Network Systems
International Journal of Performability Engineering, Vol. 5, No. 5, October 9, pp. 485-49. RAMS Consultants Printed in India Reliability Analysis of Gamma Interconnection Network Systems 1. Introduction
More informationFault-Tolerant Routing Algorithm in Meshes with Solid Faults
Fault-Tolerant Routing Algorithm in Meshes with Solid Faults Jong-Hoon Youn Bella Bose Seungjin Park Dept. of Computer Science Dept. of Computer Science Dept. of Computer Science Oregon State University
More informationLecture 2: Topology - I
ECE 8823 A / CS 8803 - ICN Interconnection Networks Spring 2017 http://tusharkrishna.ece.gatech.edu/teaching/icn_s17/ Lecture 2: Topology - I Tushar Krishna Assistant Professor School of Electrical and
More informationThis paper describes and evaluates the Dual Reinforcement Q-Routing algorithm (DRQ-Routing)
DUAL REINFORCEMENT Q-ROUTING: AN ON-LINE ADAPTIVE ROUTING ALGORITHM 1 Shailesh Kumar Risto Miikkulainen The University oftexas at Austin The University oftexas at Austin Dept. of Elec. and Comp. Engg.
More informationAnalysis and Algorithms for Partial Protection in Mesh Networks
Analysis and Algorithms for Partial Protection in Mesh Networks Greg uperman MIT LIDS Cambridge, MA 02139 gregk@mit.edu Eytan Modiano MIT LIDS Cambridge, MA 02139 modiano@mit.edu Aradhana Narula-Tam MIT
More informationROBUST FACE DETECTION UNDER CHALLENGES OF ROTATION, POSE AND OCCLUSION
ROBUST FACE DETECTION UNDER CHALLENGES OF ROTATION, POSE AND OCCLUSION Phuong-Trinh Pham-Ngoc, Quang-Linh Huynh Department o Biomedical Engineering, Faculty o Applied Science, Hochiminh University o Technology,
More informationNesting points in the sphere. Dan Archdeacon. University of Vermont. Feliu Sagols.
Nesting points in the sphere Dan Archdeacon Dept. of Computer Science University of Vermont Burlington, VT, USA 05405 e-mail: dan.archdeacon@uvm.edu Feliu Sagols Dept. of Computer Science University of
More informationA 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 informationCS485/685 Computer Vision Spring 2012 Dr. George Bebis Programming Assignment 2 Due Date: 3/27/2012
CS8/68 Computer Vision Spring 0 Dr. George Bebis Programming Assignment Due Date: /7/0 In this assignment, you will implement an algorithm or normalizing ace image using SVD. Face normalization is a required
More informationNetwork Routing - II Failures, Recovery, and Change
MIT 6.02 DRAFT Lecture Notes Spring 2009 (Last update: April 27, 2009) Comments, questions or bug reports? Please contact Hari Balakrishnan (hari@mit.edu) or 6.02-staff@mit.edu LECTURE 21 Network Routing
More informationCSC630/CSC730: Parallel Computing
CSC630/CSC730: Parallel Computing Parallel Computing Platforms Chapter 2 (2.4.1 2.4.4) Dr. Joe Zhang PDC-4: Topology 1 Content Parallel computing platforms Logical organization (a programmer s view) Control
More informationNon-Uniform Memory Access (NUMA) Architecture and Multicomputers
Non-Uniform Memory Access (NUMA) Architecture and Multicomputers Parallel and Distributed Computing MSc in Information Systems and Computer Engineering DEA in Computational Engineering Department of Computer
More informationBMVC 1996 doi: /c.10.41
On the use of the 1D Boolean model for the description of binary textures M Petrou, M Arrigo and J A Vons Dept. of Electronic and Electrical Engineering, University of Surrey, Guildford GU2 5XH, United
More informationLECT-05, S-1 FP2P, Javed I.
A Course on Foundations of Peer-to-Peer Systems & Applications LECT-, S- FPP, javed@kent.edu Javed I. Khan@8 CS /99 Foundation of Peer-to-Peer Applications & Systems Kent State University Dept. of Computer
More informationAn efficient greedy algorithm to create adaptive trees for fault localization in binary reversible circuits
An efficient greedy algorithm to create adaptive trees for fault localization in binary reversible circuits Kavitha Ramasamy, Radhika Tagare, Ed erkins and Marek erkowski Department of Electrical and Computer
More informationCombining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing?
Combining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing? J. Flich 1,P.López 1, M. P. Malumbres 1, J. Duato 1, and T. Rokicki 2 1 Dpto. Informática
More informationAN ad hoc network is a collection of mobile nodes
96 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 19, NO. 7, JULY 008 A Sel-Stabilizing Leader Election Algorithm in Highly Dynamic Ad Hoc Mobile Networks Abdelouahid Derhab and Nadjib Badache
More informationA Classification System and Analysis for Aspect-Oriented Programs
A Classiication System and Analysis or Aspect-Oriented Programs Martin Rinard, Alexandru Sălcianu, and Suhabe Bugrara Massachusetts Institute o Technology Cambridge, MA 02139 ABSTRACT We present a new
More informationComputer Technology Institute. Patras, Greece. In this paper we present a user{friendly framework and a
MEASURING SOFTWARE COMPLEXITY USING SOFTWARE METRICS 1 2 Xenos M., Tsalidis C., Christodoulakis D. Computer Technology Institute Patras, Greece In this paper we present a user{friendly framework and a
More informationCPSC 320 Sample Solution, Playing with Graphs!
CPSC 320 Sample Solution, Playing with Graphs! September 23, 2017 Today we practice reasoning about graphs by playing with two new terms. These terms/concepts are useful in themselves but not tremendously
More information4. 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 informationA Fault-Tolerant P2P-based Protocol for Logical Networks Interconnection
A Fault-Tolerant P2P-based Protocol for Logical Networks Interconnection Jaime Lloret 1, Juan R. Diaz 2, Fernando Boronat 3 and Jose M. Jiménez 4 Department of Communications, Polytechnic University of
More informationSensors & Transducers 2016 by IFSA Publishing, S. L.
Sensors & ransducers 06 by IFSA Publishing, S. L. http://www.sensorsportal.com Polynomial Regression echniques or Environmental Data Recovery in Wireless Sensor Networks Kohei Ohba, Yoshihiro Yoneda, Koji
More informationOn Checkpoint Latency. Nitin H. Vaidya. In the past, a large number of researchers have analyzed. the checkpointing and rollback recovery scheme
On Checkpoint Latency Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, TX 77843-3112 E-mail: vaidya@cs.tamu.edu Web: http://www.cs.tamu.edu/faculty/vaidya/ Abstract
More informationScheduling in Multihop Wireless Networks without Back-pressure
Forty-Eighth Annual Allerton Conerence Allerton House, UIUC, Illinois, USA September 29 - October 1, 2010 Scheduling in Multihop Wireless Networks without Back-pressure Shihuan Liu, Eylem Ekici, and Lei
More informationRowena Cole and Luigi Barone. Department of Computer Science, The University of Western Australia, Western Australia, 6907
The Game of Clustering Rowena Cole and Luigi Barone Department of Computer Science, The University of Western Australia, Western Australia, 697 frowena, luigig@cs.uwa.edu.au Abstract Clustering is a technique
More informationFast Topology Management in Large Overlay Networks
Topology as a key abstraction Fast Topology Management in Large Overlay Networks Ozalp Babaoglu Márk Jelasity Alberto Montresor Dipartimento di Scienze dell Informazione Università di Bologna! Topology
More informationOn Performance Evaluation of Reliable Topology Control Algorithms in Mobile Ad Hoc Networks (Invited Paper)
On Performance Evaluation of Reliable Topology Control Algorithms in Mobile Ad Hoc Networks (Invited Paper) Ngo Duc Thuan 1,, Hiroki Nishiyama 1, Nirwan Ansari 2,andNeiKato 1 1 Graduate School of Information
More informationSUPER RESOLUTION IMAGE BY EDGE-CONSTRAINED CURVE FITTING IN THE THRESHOLD DECOMPOSITION DOMAIN
SUPER RESOLUTION IMAGE BY EDGE-CONSTRAINED CURVE FITTING IN THE THRESHOLD DECOMPOSITION DOMAIN Tsz Chun Ho and Bing Zeng Department o Electronic and Computer Engineering The Hong Kong University o Science
More informationData Communication. Chapter # 1: Introduction. By: William Stalling
Data Communication Chapter # 1: By: Introduction William Stalling Data Communication The exchange of data between two devices via some form of transmission medium such as cable wire. For data communications
More informationAbalone Age Prediction using Artificial Neural Network
IOSR Journal o Computer Engineering (IOSR-JCE) e-issn: 2278-066,p-ISSN: 2278-8727, Volume 8, Issue 5, Ver. II (Sept - Oct. 206), PP 34-38 www.iosrjournals.org Abalone Age Prediction using Artiicial Neural
More informationOn Checkpoint Latency. Nitin H. Vaidya. Texas A&M University. Phone: (409) Technical Report
On Checkpoint Latency Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, TX 77843-3112 E-mail: vaidya@cs.tamu.edu Phone: (409) 845-0512 FAX: (409) 847-8578 Technical Report
More informationPerformance Behavior of Unmanned Vehicle Aided Mobile Backbone Based Wireless Ad Hoc Networks
Performance Behavior of Unmanned Vehicle Aided Mobile Backbone Based Wireless Ad Hoc Networks Izhak Rubin and Runhe Zhang Abstract We introduce Unmanned Vehicles (UVs) to aid the operation of the mobile
More informationreasonable to store in a software implementation, it is likely to be a signicant burden in a low-cost hardware implementation. We describe in this pap
Storage-Ecient Finite Field Basis Conversion Burton S. Kaliski Jr. 1 and Yiqun Lisa Yin 2 RSA Laboratories 1 20 Crosby Drive, Bedford, MA 01730. burt@rsa.com 2 2955 Campus Drive, San Mateo, CA 94402. yiqun@rsa.com
More informationThis 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 informationMultilevel Fault-tolerance for Designing Dependable Wireless Networks
Multilevel Fault-tolerance for Designing Dependable Wireless Networks Upkar Varshney Department of Computer Information Systems Georgia State University Atlanta, Georgia 30302-4015 E-mail: uvarshney@gsu.edu
More informationBackup segments. Path after failure recovery. Fault. Primary channel. Initial path D1 D2. Primary channel 1. Backup channel 1.
A Segmented Backup Scheme for Dependable Real Time Communication in Multihop Networks Gummadi P. Krishna M. Jnana Pradeep and C. Siva Ram Murthy Department of Computer Science and Engineering Indian Institute
More informationAcyclic orientations do not lead to optimal deadlock-free packet routing algorithms
Acyclic orientations do not lead to optimal deadloc-ree pacet routing algorithms Daniel Šteanovič 1 Department o Computer Science, Comenius University, Bratislava, Slovaia Abstract In this paper e consider
More informationInternal Accession Date Only
Extension o Morphological Operations to Complete Semilattices and its Applications to Image and Video Processing Renato Kresch HP Laboratories Israel Abstract Mathematical Morphology is a nonlinear image
More informationCOMPARISON OF OCTAGON-CELL NETWORK WITH OTHER INTERCONNECTED NETWORK TOPOLOGIES AND ITS APPLICATIONS
International Journal of Computer Engineering and Applications, Volume VII, Issue II, Part II, COMPARISON OF OCTAGON-CELL NETWORK WITH OTHER INTERCONNECTED NETWORK TOPOLOGIES AND ITS APPLICATIONS Sanjukta
More information2. LITERATURE REVIEW. Performance Evaluation of Ad Hoc Networking Protocol with QoS (Quality of Service)
2. LITERATURE REVIEW I have surveyed many of the papers for the current work carried out by most of the researchers. The abstract, methodology, parameters focused for performance evaluation of Ad-hoc routing
More informationCOMMENTS ON ARRAY CONFIGURATIONS. M.C.H. Wright. Radio Astronomy laboratory, University of California, Berkeley, CA, ABSTRACT
Bima memo 66 - May 1998 COMMENTS ON ARRAY CONFIGURATIONS M.C.H. Wright Radio Astronomy laboratory, University of California, Berkeley, CA, 94720 ABSTRACT This memo briey compares radial, circular and irregular
More informationSIMULATION OPTIMIZER AND OPTIMIZATION METHODS TESTING ON DISCRETE EVENT SIMULATIONS MODELS AND TESTING FUNCTIONS
SIMULATION OPTIMIZER AND OPTIMIZATION METHODS TESTING ON DISCRETE EVENT SIMULATIONS MODELS AND TESTING UNCTIONS Pavel Raska (a), Zdenek Ulrych (b), Petr Horesi (c) (a) Department o Industrial Engineering
More informationWHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?
WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX? MARIA AXENOVICH Abstract. It is well known that any two longest paths in a connected graph share a vertex. It is also known that there are connected graphs
More informationSupplementary Information for Publication
Supplementary Inormation or Publication Large-area one-step assembly o 3-dimensional porous metal micro/nanocages by ethanol-assisted emtosecond laser irradiation or enhanced antirelection and hydrophobicity
More informationAUTOMATING THE DESIGN OF SOUND SYNTHESIS TECHNIQUES USING EVOLUTIONARY METHODS. Ricardo A. Garcia *
AUTOMATING THE DESIGN OF SOUND SYNTHESIS TECHNIQUES USING EVOLUTIONARY METHODS Ricardo A. Garcia * MIT Media Lab Machine Listening Group 20 Ames St., E5-49, Cambridge, MA 0239 rago@media.mit.edu ABSTRACT
More informationRough Connected Topologized. Approximation Spaces
International Journal o Mathematical Analysis Vol. 8 04 no. 53 69-68 HIARI Ltd www.m-hikari.com http://dx.doi.org/0.988/ijma.04.4038 Rough Connected Topologized Approximation Spaces M. J. Iqelan Department
More informationAnalysis 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