Scheduling Techniques of Processor Scheduling in Cellular Automaton
|
|
- Barnard Cross
- 6 years ago
- Views:
Transcription
1 International Conference on Intelligent Computational Systems (ICICS'22) Jan. 7-8, 22 Dubai Scheduling Techniques of Processor Scheduling in Cellular Automaton Mohammad S. Laghari and Gulzar A. Khuwaja Abstract Many problems in computer simulation of systems in science and engineering present potential for parallel implementations through one of the three major paradigms of algorithmic parallelism, geometric parallelism and processor farming. Static process scheduling techniques have been used successfully to eploit geometric and algorithmic parallelism, while dynamic process scheduling is better suited to dealing with the independent processes inherent in the process farming paradigm. This paper considers the application of parallel or multi-computers to a class of problems ehibiting spatial data dependency characteristic of the geometric paradigm. However, by using processor farming paradigm in conjunction with geometric decomposition, a dynamic scheduling technique is developed to suit the MIMD structure of the multi-computers. The specific problem chosen for the investigation of scheduling techniques is the computer simulation of Cellular Automaton models. Keywords Cellular Automaton, multi-computers, parallel paradigms, scheduling. S I. INTRODUCTION TATIC and dynamic scheduling of processes are techniques that can be used to optimize performance in parallel computing systems. When dealing with such systems an acceptable balance between communication and computation times is required to ensure efficient use of processing resources. When the time to perform the compute on a subproblem is less than the time taken to receive the data or transmit the results, then the communication bandwidth becomes a limit to performance. With dynamic scheduling, an appropriate program can redirect the flow of data at run time to keep the processors as busy as possible and help achieve optimum performance []. The problem chosen here for the investigation of scheduling techniques is the cellular automaton (C.A.). The C.A. approach has been used in many applications, such as image processing, self learning machines, fluid dynamics and modeling parallel computers. Because of their small compute requirements, many C.A. algorithms implemented on a network of processors, ehibit the above discussed imbalance. Mohammad S. Laghari is with the Electrical Engineering Department, Faculty of Engineering, United Arab Emirates University, P.O. Bo: 7555, Al Ain, U.A.E. (phone: ; fa: ; mslaghari@uaeu.ac.ae). Gulzar A. Khuwaja is with the Department of Computer Engineering, College of Computer Sciences & Information Technology, King Faisal University, Al Ahsa 3982, Kingdom of Saudi Arabia ( Khuwaja@kfu.edu.sa). A cellular automaton simulation, with artificially increased compute load per cell (in the form of number of simulated multiplies) is considered for parallelization. Such a simulation is representative of a class of recursive algorithms with local spatial dependency and fine granularity that may be encountered in biological applications, finite elements, certain problems in image analysis and computational geometry [2]- [5]. These types of applications ehibit geometric parallelism and may be considered best suited to static scheduling. However, using dynamic scheduling, the MIMD structure of multicomputer networks is eploited, and comparison of both the schemes is given in the form of total timings and speedup. II. THE C.A. MODEL Cellular automata were introduced in the late forties by John von Neumann, following a suggestion of Stan Ulam, to provide a more realistic model for the behavior of comple, etended systems [6]. In its simplest form, a cellular automaton consists of a lattice or line of sites known as cells, each with value or. These values are updated in a sequence of discrete time steps according to a definite, fied, rule. The overall properties of a cellular automaton are usually not readily evident from its basic rule. But given these rules, its behavior can always be determined by eplicit simulation on a digital computer. Cellular automata are mathematical idealizations of physical systems in which space and time are discrete, and physical quantities take on finite set of discrete values. The C.A. model used in this investigation is a -dimensional cellular automaton where processing takes place by a near homogeneous system having a fine level of granularity. It is conceptually simple and has a high degree of parallelism. It consists of a line of cells or sites i, (where i =,..., n) with periodic boundary conditions n = which means that last cell in the line of site is connected to the first cell. Each cell can store a single value or variable known as its state. At regular intervals in time the value of cells are simultaneously (synchronously) updated according to a local transition rule whose result depends on the previous state of the cell and those of its neighbors. The neighborhood of a given site is simply the site itself and the sites immediately adjacent to it on the left and right. Each cell may eist in one of two states i = or. The local rules of C.A. can be described by an eight-digit binary number as shown in the following eample. Fig. specifies one particular set of rules for an elementary C.A. 96
2 International Conference on Intelligent Computational Systems (ICICS'22) Jan. 7-8, 22 Dubai Fig. The 8 possible states of 3 adjacent sites The top row gives all the 2 3 = 8 possible values of the three sites in the neighborhood, and below each one is given the values achieved by the middle site on the net time step according to a particular local rule. As any eight-digit binary number specifies a cellular automaton, therefore there are 2 8 = 256 possible distinct C.A. rules in one dimension with a 3 site neighborhood. The rule in the lower line of the Fig. is rule number 5 () which have been used for the implementation of C.A. algorithms in this paper. The rules may be considered as a Boolean function of the sites within the neighborhood. Let i (t) be the value of site i at time step t. For the above eample, the value of a particular site is simply the sum modulo two of the values of its own and its two neighboring sites on the previous time step. The Boolean equivalent of this rule is given by: TABLE I FINDING RULE NUMBER IN BINARY FORM A B C output i ( t ) = ( i ( t) i ( t) i ( t))) REM 2 where REM is the remainder function. This can be written in the form of: i ( t ) = i ( t) i i ( t) or schematically = where, denotes addition modulo two or eclusive disjunction, denotes value of a particular site for the net time step and,, denotes values of its own and its neighboring sites on the previous time step, respectively. The following shows how the above equations relate to rule number 5 of C.A. Suppose A, B, C Fig. 2 Evolution of -D C.A. through two time steps Fig. 3 shows evolution of -dimensional elementary cellular automaton according to the above described rule, starting from a state containing a single site with value. Sites and are represented with * s and s, respectively. The configuration of the cellular automaton at successive time steps is shown on successive lines. The time evolution is shown for at most 2 time steps or up to the point where system is detected to cycle. then using Boolean laws the schematic equation becomes: A B C ( A. B A. B) C A. C A. C A. C A. C Putting this equation in the truth Table I shows the output giving rule number 5 in the binary form when read from the most significant bit = = 5 Fig. 2 shows the evolution of a particular state of the C.A. through two time steps in the above eample. Fig. 3 Evolution of C.A. into a configuration up to 2 time steps III. PARALLEL PARADIGMS In order to efficiently utilize the computational potential of a large number of processors in a parallel processing environment, it is necessary to identify the important parallel features of the application. There are several simple paradigms for eploiting parallelism in scientific and engineering applications, but the most commonly occurring types fall into three classes. These three paradigms are described in more detail in [7], [8]. 97
3 International Conference on Intelligent Computational Systems (ICICS'22) Jan. 7-8, 22 Dubai A. Algorithmic Parallelism Is present where the algorithm can be broken down into a pipeline of processors. In this decomposition the data flows through the processing elements. Geometric Parallelism Is present where the problem can be broken down into a number similar processes in such a way as to preserve processor data locality and each processor operate on different subset of the total data to be processed. C. Processor Farm Is present where each processor is eecuting the same program with different initial data in isolation from all the other processors in the farm [9], []. Results of all iterations are communicated back to the master processor. Simulation tests are carried out for 2 iterations or time steps using from to 7 slave processors, supplied with fied size array segments for the total array length of 768 cells. Artificially increased compute loads in the form of multiplies per cell (in steps of 2 multiplies) are introduced. Five loads of 2, 4, 6, 8 and multiplies, respectively are used, which reside in the worker process of each slave. Table II shows the total timings in seconds for a normal and a range of artificially increased compute loads. TABLE II TOTAL TIMING IN SECONDS FOR 2 ITERATIONS IN STATIC SCHEME IV. ALGORITHMS In order to meet the high speed and performance, a scalable and reconfigurable multi-computer system (NPLA) is used. This networked multi-computer system is a bit similar to the NePA system used to implement Network-on-Chip []. The system used is a linear array of processors. It includes RISC processors and memory blocks. Each processor in the array has a compactor, internal instruction memory, internal data memory, data control unit, and registers. One of the processors is used as a master or main processor and the remaining as slaves. The system has a network interface with the main processor having four and others equipped with two port routers. Routers can transfer both control as well as application data among processors. The two scheduling algorithms are described: A. Static Algorithm In this implementation of cellular automaton, the problem is statically implemented by using array processing. The algorithm is properly decomposed by using geometrical parallelism. Ideally, the master processor should distribute fied number of cells uniformly across the ring of slave processors. At the start of an individual iteration, each cell process broadcasts the current state of the cell to its neighbors in parallel with inputting the states of its neighbors from the neighboring cell processes. After this echange of data, the cell update its new state using the rule described earlier. Instead of individual cell processes in each slave which communicated with the neighboring cells after every update, the master processor distributes fied size array segments of cells (for a total length of a maimum768 cells) uniformly across the worker array, with each processor being responsible for the defined spatial area. Each iteration starts with slave processors first echange boundary information with the neighboring processors in such a way that end elements of each array segment carry information of the end elements of the neighboring segments. After this echange, the array segment updates the results with the help of the neighboring elements for all the elements in parallel by using the cellular automaton rule described earlier. The updated results are assigned in another array. Result without the additional compute load shows no improvement in performance when the algorithm is implemented on multiple processors. The communications take more time than the computation in each slave. Results with the compute load of 2 additional multiply show that there is a reasonable improvement in timings. The comparison shows that with the increase in the compute load, the overall performance of the algorithm and the utilization of the processors proportionally improve. Dynamic Algorithm In the previous implementation the allocation of processes to processors is defined at compile time. It is possible to have the program perform the process allocation as it runs. In this implementation of cellular automaton, distribution of processing loads is performed dynamically. The topology used is the same as in the previous eamples, which is a master processor and up to 7 slaves, now operating as a farm of processors with the code replicated on each of them. In this algorithm, the master processor distributes work packets to the farm of slave processors. This processor is also responsible for geometrical decomposition and the tracking of the work packets through the iteration sequence. It consists of two main processes of send and receive, which eecute in parallel and share two large arrays of data send and data receive. At the start of the first iteration, the send process farms out fied size data packets from the send array (which contains the line of site to be computed) to the slave processors. Each data packet includes; an array segment of cells, address of the segment location in the send array, and information about the end elements of the neighboring segments. 98
4 International Conference on Intelligent Computational Systems (ICICS'22) Jan. 7-8, 22 Dubai The slave processors operate two main processes both running in parallel. One is a worker process where actual computation takes place and is run in low priority with the other which is a work_packet_schedular as shown in Fig. 4. Fig. 4 Work packet schedular on slave processors The work_packet_schedular on each slave consists of: a schedular process which inputs data packets from the master and schedules tasks through buffers either to the worker process or to the net processor in the chain of slaves on the first come first served basis. The buffers operate as request buffers which is as soon as the buffers have served their tasks, more work is requested from the scheduler process. If request for work from the worker process and net processor arrive at the same time then priority is given to the worker process. a data_passer process which inputs resultant data through buffers both from the worker process or previous processor on the first come first served basis and forwards it to the net processor leading towards the master processor. In order to keep the slave processors busy, the task schedular buffers an etra item of work so that when the worker process completes the computation for an array segment it can start on its net at once rather than having to wait for the master processor to send the net item of work. The worker process inputs the array segment together with the information of the end bits of neighboring segments and the address bits. Then, updates the segment according to the C.A. rule described earlier, stores the result in another array, adds address bits and communicates it to the data_passer process. The processed array segments together with the address bits are received by the other main process of receive in the master processor and are placed in the data receive array at the appropriate positions. This completes the first iteration. For subsequent iterations, array segments can only be sent for processing if adjoining neighbors are present; this is because of the end element information of the neighboring segments. Therefore, as soon as the master processor receives 3 contiguous segments in the data receive array, it copies the middle segment to the data send array. When 3 contiguous segments are copied to the data send array, then the middle segment from this array is sent to the slaves for further processing. Eperiments are performed on the dynamically allocated scheme by varying the network sizes, the computational loads, and the size of the work packets in order to obtain optimum performance parameters. Timings from to 7 slave processors are obtained for 2 iterations. Eperiments are performed with varying packet sizes of 2, 24, and 48 cells for the total array length of 768 cells. Additional compute loads in the form of 2, 4, 6, 8 and multiplies, are used. Table III shows computation timings in seconds for the array lengths of 24 for the dynamic scheme. The results of dynamic allocation show reasonable improvements in timings for the three packet sizes; the eception being the compute load of 2 multiplies which shows small improvements in performance for smaller networks. TABLE III TIMING FOR 2 ITERATIONS IN DYNAMIC SCHEME FOR 24 CELLS The speedup for the packet size of 24 cells show very good results for all the additional compute loads ecept for case of 2 multiply as shown in Fig. 5. A near linear speedup is shown when four slave processors are used. For the load of 6 multiplies, speedup of 5.76 is achieved when all the slaves are used. The results for the three segment sizes of 2, 24 and 48 cells are compared with artificially increased compute loads in terms of speedup. For comparison, compute loads of 2 and multiplies are chosen. Fig. 6 shows speedup, for the case of 2 multiplies. Array size of 2 cells shows no improvements in the result. The reason being that for the case of 2 cells, the master processor distributes 64 array segments for each line of site of 768 cells. Therefore, the master communicates a total of 28 array segments to do 2 iterations. With the compute load of 2 multiplies for each cell, the system does not balance the computation and communication loads. The results prove that 99
5 International Conference on Intelligent Computational Systems (ICICS'22) Jan. 7-8, 22 Dubai the system is taking much more time to communicate data packets of this size to and from the slave processors and thus show poor performance. Increasing the size of the data packets for the additional load of 2 multiplies has a small effect on the performance. The array size of 48 cells shows slight improvements for up to 3 slave processors. Fig. 8 Comparison of timings between the two schemes Fig. 5 Speedup for 24 cells in dynamic scheme Fig. 6 Comparison of speedup results for the load of 2 multiplies Fig. 7 shows the speedup, for the case of multiplies. Ecellent results are obtained for all the array segments, when from to 4 slave processors are used. Again, the array size of 24 cells gives the best performance results for using all the available slave processors. Therefore, when comparing the results for all the additional compute loads, array segment of size 24 with the compute load of multiplies gives the best performance parameters in the dynamic scheduling scheme. Fig. 7 Comparison of speedup for the load of multiplies Fig. 8 shows the timing comparison for two schemes for seven processors. Ecept for 2 compute load, the dynamic scheme performs better for all other loads. V. CONCLUSION In this paper we have considered a modified C.A. model with artificially increased load. The recursive structure and spatial data dependency of this algorithm is representative of an important class of algorithms in science and engineering. The paper investigates the performance of scheduling techniques for the implementation of this type of algorithm on multicomputer networks. Eperiments performed on implementation of above techniques suggest that over certain ranges of compute load, dynamic scheduling can outperform its rival in terms of speedup. REFERENCES [] T. L. Casavant and J. G. Kuhl, A Taonomy of Scheduling in General- Purpose Distributed Computing Systems, IEEE Trans. on Software Engineering, vol. 4, no. 2, Feb [2] M. V. Avolio, A. Errara, V. Lupiano, P. Mazzanti, and S. D. Gregorio, Development and Calibration of a Preliminary Cellular Automata Model for Snow Avalanches, in Proc. 9th Int. Conf. on Cellular Automata for Research and Industry, Ascoli Piceno, Italy, 2, pp [3] D. Cacciagrano, F. Corradini, and E. Merelli, Bone Remodelling: A Comple Automata-Based Model Running in BIO SHAPE, in Proc. 9th Int. Conf. on Cellular Automata for Research and Industry, Ascoli Piceno, Italy, 2, pp [4] M. Ghaemi, O. Naderi, and Z. Zabihinpour, A Novel Method for Simulating Cancer Growth, in Proc. 9th Int. Conf. on Cellular Automata for Research and Industry, Ascoli Piceno, Italy, 2, pp [5] Y. Zhao, S. A. Billing, and A. F. Routh, "Identification of Ecitable Media Using Cellular Automata Models, Int. J. of Bifurcation and Chaos, vol. 7, pp , 27. [6] A. IIanchinski, Cellular Automata A Discrete Universe. Singapore: World Scientific Publishing, 2. [7] D. J. Pritchard, Transputer Applications on Supernode, in Proc. Int. Conf. on Application of Transputers, Liverpool, U.K., Aug [8] M. S. Laghari and F. Deravi, Scheduling Techniques for the Parallel Implementation of the Hough Transform, in Proc. Engineering System Design and Analysis, Istanbul, Turkey, 992, pp [9] A. S. Wagner, H. V. Sreekantaswamy, and S. T. Chanson, Performance Models for the Processor Farm Paradigm, IEEE Trans. on Parallel and Distributed Systems, vol. 8, no. 5, pp , May 997. [] A. Walsch, Architecture and Prototype of a Real-Time Processor Farm Running at MHz, Ph.D. Thesis, University of Mannheim, Mannheim, Germany 22. [] Y. S. Yang, J. H. Bahn, S. E. Lee, and N. Bagherzadeh, Parallel and Pipeline Processing for Block Cipher Algorithms on a Network-on- Chip, in proc. 6th Int. Conf. on Information Technology: New Generations, Las Vegas, Nevada, Apr. 29, pp
Scheduling Techniques to Classify Wear Particles on Multi-Computers
Scheduling Techniques to Classify Wear Particles on Multi-Computers Mohammad Shakeel Laghari 1 & Gulzar Ali Khuwaja 2 1 Department of Electrical Engineering UAE University, Al Ain, United Arab Emirates
More informationSelf-formation, Development and Reproduction of the Artificial System
Solid State Phenomena Vols. 97-98 (4) pp 77-84 (4) Trans Tech Publications, Switzerland Journal doi:.48/www.scientific.net/ssp.97-98.77 Citation (to be inserted by the publisher) Copyright by Trans Tech
More informationSIMULATION OF ARTIFICIAL SYSTEMS BEHAVIOR IN PARAMETRIC EIGHT-DIMENSIONAL SPACE
78 Proceedings of the 4 th International Conference on Informatics and Information Technology SIMULATION OF ARTIFICIAL SYSTEMS BEHAVIOR IN PARAMETRIC EIGHT-DIMENSIONAL SPACE D. Ulbikiene, J. Ulbikas, K.
More informationRGB Digital Image Forgery Detection Using Singular Value Decomposition and One Dimensional Cellular Automata
RGB Digital Image Forgery Detection Using Singular Value Decomposition and One Dimensional Cellular Automata Ahmad Pahlavan Tafti Mohammad V. Malakooti Department of Computer Engineering IAU, UAE Branch
More informationCOMPUTER SIMULATION OF COMPLEX SYSTEMS USING AUTOMATA NETWORKS K. Ming Leung
POLYTECHNIC UNIVERSITY Department of Computer and Information Science COMPUTER SIMULATION OF COMPLEX SYSTEMS USING AUTOMATA NETWORKS K. Ming Leung Abstract: Computer simulation of the dynamics of complex
More information6. Parallel Volume Rendering Algorithms
6. Parallel Volume Algorithms This chapter introduces a taxonomy of parallel volume rendering algorithms. In the thesis statement we claim that parallel algorithms may be described by "... how the tasks
More informationRobots & Cellular Automata
Integrated Seminar: Intelligent Robotics Robots & Cellular Automata Julius Mayer Table of Contents Cellular Automata Introduction Update Rule 3 4 Neighborhood 5 Examples. 6 Robots Cellular Neural Network
More informationOptimization of Vertical and Horizontal Beamforming Kernels on the PowerPC G4 Processor with AltiVec Technology
Optimization of Vertical and Horizontal Beamforming Kernels on the PowerPC G4 Processor with AltiVec Technology EE382C: Embedded Software Systems Final Report David Brunke Young Cho Applied Research Laboratories:
More informationApplication of Totalistic Cellular Automata for Noise Filtering in Image Processing
Journal of Cellular Automata, Vol. 7, pp. 207 221 Reprints available directly from the publisher Photocopying permitted by license only 2012 Old City Publishing, Inc. Published by license under the OCP
More informationGeneralized Coordinates for Cellular Automata Grids
Generalized Coordinates for Cellular Automata Grids Lev Naumov Saint-Peterburg State Institute of Fine Mechanics and Optics, Computer Science Department, 197101 Sablinskaya st. 14, Saint-Peterburg, Russia
More informationAn Adaptive Self-Organization Protocol for Wireless Sensor Networks
An Adaptive Self-Organization Protocol for Wireless Sensor Networks Kil-Woong Jang 1 and Byung-Soon Kim 2 1 Dept. of Mathematical and Information Science, Korea Maritime University 1 YeongDo-Gu Dongsam-Dong,
More informationCellular Learning Automata-Based Color Image Segmentation using Adaptive Chains
Cellular Learning Automata-Based Color Image Segmentation using Adaptive Chains Ahmad Ali Abin, Mehran Fotouhi, Shohreh Kasaei, Senior Member, IEEE Sharif University of Technology, Tehran, Iran abin@ce.sharif.edu,
More informationNormal Algorithmetic Implementation of Cellular Automata
Normal Algorithmetic Implementation of Cellular Automata G. Ramesh Chandra, V. Dhana Lakshmi Dept. of Computer Science and Engineering VNR Vignana Jyothi Institute of Engineering & Technology Hyderabad,
More informationCellular Automata on the Micron Automata Processor
Cellular Automata on the Micron Automata Processor Ke Wang Department of Computer Science University of Virginia Charlottesville, VA kewang@virginia.edu Kevin Skadron Department of Computer Science University
More informationUNIT 9C Randomness in Computation: Cellular Automata Principles of Computing, Carnegie Mellon University
UNIT 9C Randomness in Computation: Cellular Automata 1 Exam locations: Announcements 2:30 Exam: Sections A, B, C, D, E go to Rashid (GHC 4401) Sections F, G go to PH 125C. 3:30 Exam: All sections go to
More informationMulti-path Routing for Mesh/Torus-Based NoCs
Multi-path Routing for Mesh/Torus-Based NoCs Yaoting Jiao 1, Yulu Yang 1, Ming He 1, Mei Yang 2, and Yingtao Jiang 2 1 College of Information Technology and Science, Nankai University, China 2 Department
More informationCOMPUTER EXERCISE: POPULATION DYNAMICS IN SPACE September 3, 2013
COMPUTER EXERCISE: POPULATION DYNAMICS IN SPACE September 3, 2013 Objectives: Introduction to coupled maps lattice as a basis for spatial modeling Solve a spatial Ricker model to investigate how wave speed
More informationGraph Adjacency Matrix Automata Joshua Abbott, Phyllis Z. Chinn, Tyler Evans, Allen J. Stewart Humboldt State University, Arcata, California
Graph Adjacency Matrix Automata Joshua Abbott, Phyllis Z. Chinn, Tyler Evans, Allen J. Stewart Humboldt State University, Arcata, California Abstract We define a graph adjacency matrix automaton (GAMA)
More informationParallelization Strategy
COSC 6374 Parallel Computation Algorithm structure Spring 2008 Parallelization Strategy Finding Concurrency Structure the problem to expose exploitable concurrency Algorithm Structure Supporting Structure
More informationCellular Automata. Cellular Automata contains three modes: 1. One Dimensional, 2. Two Dimensional, and 3. Life
Cellular Automata Cellular Automata is a program that explores the dynamics of cellular automata. As described in Chapter 9 of Peak and Frame, a cellular automaton is determined by four features: The state
More informationSerial. Parallel. CIT 668: System Architecture 2/14/2011. Topics. Serial and Parallel Computation. Parallel Computing
CIT 668: System Architecture Parallel Computing Topics 1. What is Parallel Computing? 2. Why use Parallel Computing? 3. Types of Parallelism 4. Amdahl s Law 5. Flynn s Taxonomy of Parallel Computers 6.
More informationHigh Performance Computing. University questions with solution
High Performance Computing University questions with solution Q1) Explain the basic working principle of VLIW processor. (6 marks) The following points are basic working principle of VLIW processor. The
More informationSpeed-up of Parallel Processing of Divisible Loads on k-dimensional Meshes and Tori
The Computer Journal, 46(6, c British Computer Society 2003; all rights reserved Speed-up of Parallel Processing of Divisible Loads on k-dimensional Meshes Tori KEQIN LI Department of Computer Science,
More informationTransactions on Information and Communications Technologies vol 3, 1993 WIT Press, ISSN
The implementation of a general purpose FORTRAN harness for an arbitrary network of transputers for computational fluid dynamics J. Mushtaq, A.J. Davies D.J. Morgan ABSTRACT Many Computational Fluid Dynamics
More informationNew Approach for Modifying Blowfish Algorithm by Using Multiple Keys
IJCSNS International Journal of Computer Science and Network Security, VOL. No.3, March 20 2 New Approach for Modifying Blowfish Algorithm by Using Multiple Keys Afaf M. Ali Al-Neaimi, Rehab F. Hassan
More informationWhat are Cellular Automata?
What are Cellular Automata? It is a model that can be used to show how the elements of a system interact with each other. Each element of the system is assigned a cell. The cells can be 2-dimensional squares,
More informationProblem Formulation. Specialized algorithms are required for clock (and power nets) due to strict specifications for routing such nets.
Clock Routing Problem Formulation Specialized algorithms are required for clock (and power nets) due to strict specifications for routing such nets. Better to develop specialized routers for these nets.
More informationPrinciple Of Parallel Algorithm Design (cont.) Alexandre David B2-206
Principle Of Parallel Algorithm Design (cont.) Alexandre David B2-206 1 Today Characteristics of Tasks and Interactions (3.3). Mapping Techniques for Load Balancing (3.4). Methods for Containing Interaction
More informationy(b)-- Y[a,b]y(a). EQUATIONS ON AN INTEL HYPERCUBE*
SIAM J. ScI. STAT. COMPUT. Vol. 12, No. 6, pp. 1480-1485, November 1991 ()1991 Society for Industrial and Applied Mathematics 015 SOLUTION OF LINEAR SYSTEMS OF ORDINARY DIFFERENTIAL EQUATIONS ON AN INTEL
More informationFixed Point LMS Adaptive Filter with Low Adaptation Delay
Fixed Point LMS Adaptive Filter with Low Adaptation Delay INGUDAM CHITRASEN MEITEI Electronics and Communication Engineering Vel Tech Multitech Dr RR Dr SR Engg. College Chennai, India MR. P. BALAVENKATESHWARLU
More informationDrawdown Automata, Part 1: Basic Concepts
Drawdown Automata, Part 1: Basic Concepts Cellular Automata A cellular automaton is an array of identical, interacting cells. There are many possible geometries for cellular automata; the most commonly
More informationA Survey of Mathematics with Applications 8 th Edition, 2009
A Correlation of A Survey of Mathematics with Applications 8 th Edition, 2009 South Carolina Discrete Mathematics Sample Course Outline including Alternate Topics and Related Objectives INTRODUCTION This
More informationApplication of Two-dimensional Periodic Cellular Automata in Image Processing
International Journal of Computer, Mathematical Sciences and Applications Serials Publications Vol. 5, No. 1-2, January-June 2011, pp. 49 55 ISSN: 0973-6786 Application of Two-dimensional Periodic Cellular
More informationCellular Automata + Parallel Computing = Computational Simulation
Cellular Automata + Parallel Computing = Computational Simulation Domenico Talia ISI-CNR c/o DEIS, Università della Calabria, 87036 Rende, Italy e-mail: talia@si.deis.unical.it Keywords: cellular automata,
More information1 Introduction 2. 2 A Simple Algorithm 2. 3 A Fast Algorithm 2
Polyline Reduction David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy
More informationA Parallel Evolutionary Algorithm for Discovery of Decision Rules
A Parallel Evolutionary Algorithm for Discovery of Decision Rules Wojciech Kwedlo Faculty of Computer Science Technical University of Bia lystok Wiejska 45a, 15-351 Bia lystok, Poland wkwedlo@ii.pb.bialystok.pl
More informationA Combined Encryption Compression Scheme Using Chaotic Maps
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 13, No 2 Sofia 2013 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.2478/cait-2013-0016 A Combined Encryption Compression
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show
More informationHomework # 2 Due: October 6. Programming Multiprocessors: Parallelism, Communication, and Synchronization
ECE669: Parallel Computer Architecture Fall 2 Handout #2 Homework # 2 Due: October 6 Programming Multiprocessors: Parallelism, Communication, and Synchronization 1 Introduction When developing multiprocessor
More informationLecture 9: Group Communication Operations. Shantanu Dutt ECE Dept. UIC
Lecture 9: Group Communication Operations Shantanu Dutt ECE Dept. UIC Acknowledgement Adapted from Chapter 4 slides of the text, by A. Grama w/ a few changes, augmentations and corrections Topic Overview
More informationTwo-dimensional Four Color Cellular Automaton: Surface Explorations
Two-dimensional Four Color Cellular Automaton: Surface Explorations Robert H. Barbour School of Computing and Information Systems, Unitec New Zealand, Carrington Road, Mount Albert, Auckland, New Zealand
More informationOutline Introduction to CA (LGA HPP model) CA computation model for real CA applications Detailed computation method Validate the model using specific
Performance evaluation of FPGA-based Cellular Automata accelerators S. Murtaza, A. G. Hoekstra, P. M. A. Sloot Section Computational Science Institute for Informatics University of Amsterdam Amsterdam,
More informationComplex Dynamics in Life-like Rules Described with de Bruijn Diagrams: Complex and Chaotic Cellular Automata
Complex Dynamics in Life-like Rules Described with de Bruijn Diagrams: Complex and Chaotic Cellular Automata Paulina A. León Centro de Investigación y de Estudios Avanzados Instituto Politécnico Nacional
More informationParallel Programming Patterns Overview CS 472 Concurrent & Parallel Programming University of Evansville
Parallel Programming Patterns Overview CS 472 Concurrent & Parallel Programming of Evansville Selection of slides from CIS 410/510 Introduction to Parallel Computing Department of Computer and Information
More informationCELLULAR AUTOMATA IN MATHEMATICAL MODELING JOSH KANTOR. 1. History
CELLULAR AUTOMATA IN MATHEMATICAL MODELING JOSH KANTOR 1. History Cellular automata were initially conceived of in 1948 by John von Neumann who was searching for ways of modeling evolution. He was trying
More informationConcepts from High-Performance Computing
Concepts from High-Performance Computing Lecture A - Overview of HPC paradigms OBJECTIVE: The clock speeds of computer processors are topping out as the limits of traditional computer chip technology are
More informationA New Encryption and Decryption Algorithm for Block Cipher Using Cellular Automata Rules
International Journal of Emerging Engineering Research and Technology Volume 3, Issue 8, August 2015, PP 130-136 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) A New Encryption and Decryption Algorithm
More informationCHAPTER 1 INTRODUCTION
1 CHAPTER 1 INTRODUCTION 1.1 Advance Encryption Standard (AES) Rijndael algorithm is symmetric block cipher that can process data blocks of 128 bits, using cipher keys with lengths of 128, 192, and 256
More informationBasic Communication Operations Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar
Basic Communication Operations Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar To accompany the text ``Introduction to Parallel Computing'', Addison Wesley, 2003 Topic Overview One-to-All Broadcast
More informationImproving the Efficiency of Fast Using Semantic Similarity Algorithm
International Journal of Scientific and Research Publications, Volume 4, Issue 1, January 2014 1 Improving the Efficiency of Fast Using Semantic Similarity Algorithm D.KARTHIKA 1, S. DIVAKAR 2 Final year
More informationData Partitioning. Figure 1-31: Communication Topologies. Regular Partitions
Data In single-program multiple-data (SPMD) parallel programs, global data is partitioned, with a portion of the data assigned to each processing node. Issues relevant to choosing a partitioning strategy
More informationSelective Boundary Cutting For Packet Classification SOUMYA. K 1, CHANDRA SEKHAR. M 2
ISSN 2319-8885 Vol.04,Issue.34, August-2015, Pages:6786-6790 www.ijsetr.com SOUMYA. K 1, CHANDRA SEKHAR. M 2 1 Navodaya Institute of Technology, Raichur, Karnataka, India, E-mail: Keerthisree1112@gmail.com.
More informationLight Weight Cellular Automata Computations and Symmetric Key for Achieving Efficient Cryptography
International Journal of Emerging Engineering Research and Technology Volume 3, Issue 12, December 2015, PP 84-91 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) Light Weight Cellular Automata Computations
More informationOn Algebraic Expressions of Generalized Fibonacci Graphs
On Algebraic Expressions of Generalized Fibonacci Graphs MARK KORENBLIT and VADIM E LEVIT Department of Computer Science Holon Academic Institute of Technology 5 Golomb Str, PO Box 305, Holon 580 ISRAEL
More informationFILTER SYNTHESIS USING FINE-GRAIN DATA-FLOW GRAPHS. Waqas Akram, Cirrus Logic Inc., Austin, Texas
FILTER SYNTHESIS USING FINE-GRAIN DATA-FLOW GRAPHS Waqas Akram, Cirrus Logic Inc., Austin, Texas Abstract: This project is concerned with finding ways to synthesize hardware-efficient digital filters given
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 informationHigh-Speed Cell-Level Path Allocation in a Three-Stage ATM Switch.
High-Speed Cell-Level Path Allocation in a Three-Stage ATM Switch. Martin Collier School of Electronic Engineering, Dublin City University, Glasnevin, Dublin 9, Ireland. email address: collierm@eeng.dcu.ie
More informationAn Evolution of Mathematical Tools
An Evolution of Mathematical Tools From Conceptualization to Formalization Here's what we do when we build a formal model (or do a computation): 0. Identify a collection of objects/events in the real world.
More informationParallel Programming Patterns
Parallel Programming Patterns Moreno Marzolla Dip. di Informatica Scienza e Ingegneria (DISI) Università di Bologna http://www.moreno.marzolla.name/ Copyright 2013, 2017, 2018 Moreno Marzolla, Università
More informationDesign of Parallel Algorithms. Models of Parallel Computation
+ Design of Parallel Algorithms Models of Parallel Computation + Chapter Overview: Algorithms and Concurrency n Introduction to Parallel Algorithms n Tasks and Decomposition n Processes and Mapping n Processes
More informationInteractive Math Glossary Terms and Definitions
Terms and Definitions Absolute Value the magnitude of a number, or the distance from 0 on a real number line Addend any number or quantity being added addend + addend = sum Additive Property of Area the
More informationContents. Preface xvii Acknowledgments. CHAPTER 1 Introduction to Parallel Computing 1. CHAPTER 2 Parallel Programming Platforms 11
Preface xvii Acknowledgments xix CHAPTER 1 Introduction to Parallel Computing 1 1.1 Motivating Parallelism 2 1.1.1 The Computational Power Argument from Transistors to FLOPS 2 1.1.2 The Memory/Disk Speed
More informationA SIMULATED ANNEALING ALGORITHM FOR SOME CLASS OF DISCRETE-CONTINUOUS SCHEDULING PROBLEMS. Joanna Józefowska, Marek Mika and Jan Węglarz
A SIMULATED ANNEALING ALGORITHM FOR SOME CLASS OF DISCRETE-CONTINUOUS SCHEDULING PROBLEMS Joanna Józefowska, Marek Mika and Jan Węglarz Poznań University of Technology, Institute of Computing Science,
More informationAdaptive edge detection via image statistic features and hybrid model of fuzzy cellular automata and cellular learning automata
2009 International Conference on Information and Multimedia Technology Adaptive edge detection via image statistic features and hybrid model of fuzzy cellular automata and cellular learning automata R.Enayatifar
More informationDesign of a New Hierarchical Structured Peer-to-Peer Network Based On Chinese Remainder Theorem
Design of a New Hierarchical Structured Peer-to-Peer Network Based On Chinese Remainder Theorem Bidyut Gupta, Nick Rahimi, Henry Hexmoor, and Koushik Maddali Department of Computer Science Southern Illinois
More informationArea And Power Efficient LMS Adaptive Filter With Low Adaptation Delay
e-issn: 2349-9745 p-issn: 2393-8161 Scientific Journal Impact Factor (SJIF): 1.711 International Journal of Modern Trends in Engineering and Research www.ijmter.com Area And Power Efficient LMS Adaptive
More informationVariations on Genetic Cellular Automata
Variations on Genetic Cellular Automata Alice Durand David Olson Physics Department amdurand@ucdavis.edu daolson@ucdavis.edu Abstract: We investigated the properties of cellular automata with three or
More informationReinforcement Learning Scheme. for Network Routing. Michael Littman*, Justin Boyan. School of Computer Science. Pittsburgh, PA
A Distributed Reinforcement Learning Scheme for Network Routing Michael Littman*, Justin Boyan Carnegie Mellon University School of Computer Science Pittsburgh, PA * also Cognitive Science Research Group,
More informationProgrammable Pattern-Formation and Scale-Independence
Programmable Pattern-Formation and Scale-Independence Radhika Nagpal PostDoctoral Lecturer, MIT Artificial Intelligence Lab radhi@ai.mit.edu This paper presents a programming language for pattern-formation
More informationHow and what do we see? Segmentation and Grouping. Fundamental Problems. Polyhedral objects. Reducing the combinatorics of pose estimation
Segmentation and Grouping Fundamental Problems ' Focus of attention, or grouping ' What subsets of piels do we consider as possible objects? ' All connected subsets? ' Representation ' How do we model
More informationA Closed Asynchronous Dynamic Model of Cellular Learning Automata and its Application to Peer-to-Peer Networks
A Closed Asynchronous Dynamic Model of Cellular Learning Automata and its Application to Peer-to-Peer Networks Ali Mohammad Saghiri *, Mohammad Reza Meybodi Soft Computing Laboratory, Computer Engineering
More informationParallelization Strategy
COSC 335 Software Design Parallel Design Patterns (II) Spring 2008 Parallelization Strategy Finding Concurrency Structure the problem to expose exploitable concurrency Algorithm Structure Supporting Structure
More informationCongestion Propagation among Routers in the Internet
Congestion Propagation among Routers in the Internet Kouhei Sugiyama, Hiroyuki Ohsaki and Makoto Imase Graduate School of Information Science and Technology, Osaka University -, Yamadaoka, Suita, Osaka,
More informationConcurrent/Parallel Processing
Concurrent/Parallel Processing David May: April 9, 2014 Introduction The idea of using a collection of interconnected processing devices is not new. Before the emergence of the modern stored program computer,
More informationSmall-scale objects extraction in digital images
102 Int'l Conf. IP, Comp. Vision, and Pattern Recognition IPCV'15 Small-scale objects extraction in digital images V. Volkov 1,2 S. Bobylev 1 1 Radioengineering Dept., The Bonch-Bruevich State Telecommunications
More informationAn Efficient Bandwidth Estimation Schemes used in Wireless Mesh Networks
An Efficient Bandwidth Estimation Schemes used in Wireless Mesh Networks First Author A.Sandeep Kumar Narasaraopeta Engineering College, Andhra Pradesh, India. Second Author Dr S.N.Tirumala Rao (Ph.d)
More informationParallel Computing. Slides credit: M. Quinn book (chapter 3 slides), A Grama book (chapter 3 slides)
Parallel Computing 2012 Slides credit: M. Quinn book (chapter 3 slides), A Grama book (chapter 3 slides) Parallel Algorithm Design Outline Computational Model Design Methodology Partitioning Communication
More informationDESIGN OF EFFICIENT ROUTING ALGORITHM FOR CONGESTION CONTROL IN NOC
DESIGN OF EFFICIENT ROUTING ALGORITHM FOR CONGESTION CONTROL IN NOC 1 Pawar Ruchira Pradeep M. E, E&TC Signal Processing, Dr. D Y Patil School of engineering, Ambi, Pune Email: 1 ruchira4391@gmail.com
More informationFinite Automata. Dr. Nadeem Akhtar. Assistant Professor Department of Computer Science & IT The Islamia University of Bahawalpur
Finite Automata Dr. Nadeem Akhtar Assistant Professor Department of Computer Science & IT The Islamia University of Bahawalpur PhD Laboratory IRISA-UBS University of South Brittany European University
More informationPIPELINE AND VECTOR PROCESSING
PIPELINE AND VECTOR PROCESSING PIPELINING: Pipelining is a technique of decomposing a sequential process into sub operations, with each sub process being executed in a special dedicated segment that operates
More informationIntroductory Combinatorics
Introductory Combinatorics Third Edition KENNETH P. BOGART Dartmouth College,. " A Harcourt Science and Technology Company San Diego San Francisco New York Boston London Toronto Sydney Tokyo xm CONTENTS
More informationImplementation of Boundary Cutting Algorithm Using Packet Classification
Implementation of Boundary Cutting Algorithm Using Packet Classification Dasari Mallesh M.Tech Student Department of CSE Vignana Bharathi Institute of Technology, Hyderabad. ABSTRACT: Decision-tree-based
More informationAbstract A SCALABLE, PARALLEL, AND RECONFIGURABLE DATAPATH ARCHITECTURE
A SCALABLE, PARALLEL, AND RECONFIGURABLE DATAPATH ARCHITECTURE Reiner W. Hartenstein, Rainer Kress, Helmut Reinig University of Kaiserslautern Erwin-Schrödinger-Straße, D-67663 Kaiserslautern, Germany
More informationCELLULAR automata (CA) are mathematical models for
1 Cellular Learning Automata with Multiple Learning Automata in Each Cell and its Applications Hamid Beigy and M R Meybodi Abstract The cellular learning automata, which is a combination of cellular automata
More informationBuffered Fixed Routing: A Routing Protocol for Real-Time Transport in Grid Networks
JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 18, NO. 6, JUNE 2000 757 Buffered Fixed Routing: A Routing Protocol for Real-Time Transport in Grid Networks Jinhan Song and Saewoong Bahk Abstract In this paper we
More informationOptimized Algorithm for Particle Swarm Optimization
Optimized Algorithm for Particle Swarm Optimization Fuzhang Zhao Abstract Particle swarm optimization (PSO) is becoming one of the most important swarm intelligent paradigms for solving global optimization
More informationTexture Segmentation by Windowed Projection
Texture Segmentation by Windowed Projection 1, 2 Fan-Chen Tseng, 2 Ching-Chi Hsu, 2 Chiou-Shann Fuh 1 Department of Electronic Engineering National I-Lan Institute of Technology e-mail : fctseng@ccmail.ilantech.edu.tw
More informationData 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 informationTop500 Supercomputer list
Top500 Supercomputer list Tends to represent parallel computers, so distributed systems such as SETI@Home are neglected. Does not consider storage or I/O issues Both custom designed machines and commodity
More informationParallel Algorithms for the Third Extension of the Sieve of Eratosthenes. Todd A. Whittaker Ohio State University
Parallel Algorithms for the Third Extension of the Sieve of Eratosthenes Todd A. Whittaker Ohio State University whittake@cis.ohio-state.edu Kathy J. Liszka The University of Akron liszka@computer.org
More informationOn Topology and Bisection Bandwidth of Hierarchical-ring Networks for Shared-memory Multiprocessors
On Topology and Bisection Bandwidth of Hierarchical-ring Networks for Shared-memory Multiprocessors Govindan Ravindran Newbridge Networks Corporation Kanata, ON K2K 2E6, Canada gravindr@newbridge.com Michael
More informationReview: Creating a Parallel Program. Programming for Performance
Review: Creating a Parallel Program Can be done by programmer, compiler, run-time system or OS Steps for creating parallel program Decomposition Assignment of tasks to processes Orchestration Mapping (C)
More informationOPTIMAL DESIGN OF A ROOF USING BIOMIMETICS
73 Mechanical Testing and Diagnosis ISSN 2247 9635, 2011 (I), Volume 1, 73-81 OPTIMAL DESIGN OF A ROOF USING BIOMIMETICS Tina KEGL II Gymnasium Maribor, Trg Miloša Zidanška 1, 2000 Maribor, SLOVENIA e-mail:
More informationEdge Detection Method based on Cellular Automata
Edge Detection Method based on Cellular Automata [1] Jyoti Swarup, [] Dr. Indu S [1] Dept. of Computer Science and Engineering, [] Dept. of Electronics & Communication Engineering, Delhi Technological
More informationPath-Planning for Multiple Generic-Shaped Mobile Robots with MCA
Path-Planning for Multiple Generic-Shaped Mobile Robots with MCA Fabio M. Marchese and Marco Dal Negro Dipartimento di Informatica, Sistemistica e Comunicazione Università degli Studi di Milano - Bicocca
More informationSimulation of the Dynamic Behavior of One-Dimensional Cellular Automata Using Reconfigurable Computing
Simulation of the Dynamic Behavior of One-Dimensional Cellular Automata Using Reconfigurable Computing Wagner R. Weinert, César Benitez, Heitor S. Lopes,andCarlosR.ErigLima Bioinformatics Laboratory, Federal
More informationEnhanced Cellular Automata for Image Noise Removal
Enhanced Cellular Automata for Image Noise Removal Abdel latif Abu Dalhoum Ibraheem Al-Dhamari a.latif@ju.edu.jo ibr_ex@yahoo.com Department of Computer Science, King Abdulla II School for Information
More informationThe Development of Scalable Traffic Simulation Based on Java Technology
The Development of Scalable Traffic Simulation Based on Java Technology Narinnat Suksawat, Yuen Poovarawan, Somchai Numprasertchai The Department of Computer Engineering Faculty of Engineering, Kasetsart
More informationEfficient Broadcast Algorithms To Reduce number of transmission Based on Probability Scheme
Efficient Broadcast s To Reduce number of transmission Based on Probability Scheme S.Tharani, R.Santhosh Abstract Two main approaches to broadcast packets in wireless ad hoc networks are static and dynamic.
More informationSimulating Spatial Partial Differential Equations with Cellular Automata
Simulating Spatial Partial Differential Equations with Cellular Automata B. Strader 1, K. Schubert 1, E. Gomez 1, J. Curnutt 1, and P. Boston 2 1 Department of Computer Science and Engineering, California
More information