scholarly journals Efficient Pipelined Broadcast with Monitoring Processing Node Status on a Multi-Core Processor

Mathematics ◽  
2019 ◽  
Vol 7 (12) ◽  
pp. 1159
Author(s):  
Jongsu Park
Keyword(s):  
Message Passing ◽  
Logic Synthesis ◽  
Verilog Hdl ◽  
Chip Area ◽  
Processing Node ◽  
The Status ◽  
Speed Up ◽  
Order Change ◽  
Previous Algorithm ◽  
Broadcasting Algorithm

This paper presents an efficient pipelined broadcasting algorithm with the inter-node transmission order change technique considering the communication status of processing nodes. The proposed method changes the transmission order for the broadcast operation based on the communication status of processing nodes. When a broadcast operation is received, a local bus checks the remaining pre-existing transmission data size of each processing node; it then transmits data according to the changed transmission order using the status information. Therefore, the synchronization time can be hidden for the remaining time, until the pre-existing data transmissions finish; as a result, the overall broadcast completion time is reduced. The simulation results indicated that the speed-up ratio of the proposed algorithm was up to 1.423, compared to that of the previous algorithm. To demonstrate physical implementation feasibility, the message passing engine (MPE) with the proposed broadcast algorithm was designed by using Verilog-HDL, which supports four processing nodes. The logic synthesis results with TSMC 0.18 μm process cell libraries show that the logic area of the proposed MPE is 2288.1 equivalent NAND gates, which is approximately 2.1% of the entire chip area. Therefore, performance improvement in multi-core processors is expected with a small hardware area overhead.

Simulation-Based Scheduling of Waterway Projects Using a Parallel Genetic Algorithm

2015 ◽  
pp. 334-347 ◽  
Author(s):  
Ning Yang ◽  
Shiaaulir Wang ◽  
Paul Schonfeld
Keyword(s):  
Genetic Algorithm ◽  
Parallel Computing ◽  
Message Passing ◽  
Message Passing Interface ◽  
Computation Time ◽  
Parallel Genetic Algorithm ◽  
Simulation Based ◽  
Multiple Processors ◽  
Simulation Based Optimization ◽  
Speed Up

A Parallel Genetic Algorithm (PGA) is used for a simulation-based optimization of waterway project schedules. This PGA is designed to distribute a Genetic Algorithm application over multiple processors in order to speed up the solution search procedure for a very large combinational problem. The proposed PGA is based on a global parallel model, which is also called a master-slave model. A Message-Passing Interface (MPI) is used in developing the parallel computing program. A case study is presented, whose results show how the adaption of a simulation-based optimization algorithm to parallel computing can greatly reduce computation time. Additional techniques which are found to further improve the PGA performance include: (1) choosing an appropriate task distribution method, (2) distributing simulation replications instead of different solutions, (3) avoiding the simulation of duplicate solutions, (4) avoiding running multiple simulations simultaneously in shared-memory processors, and (5) avoiding using multiple processors which belong to different clusters (physical sub-networks).

A Parallel Block Predictor-Corrector Method by Python-Based Distributed Computing

2012 ◽  
Vol 263-266 ◽  
pp. 1315-1318
Author(s):  
Kun Ming Yu ◽  
Ming Gong Lee
Keyword(s):  
Differential Equations ◽  
Numerical Solution ◽  
Numerical Method ◽  
Initial Value Problem ◽  
Message Passing ◽  
Message Passing Interface ◽  
Parallel Structure ◽  
Initial Value ◽  
Speed Up ◽  
Predictor Corrector

This paper is to discuss how Python can be used in designing a cluster parallel computation environment in numerical solution of some block predictor-corrector method for ordinary differential equations. In the parallel process, MPI-2(message passing interface) is used as a standard of MPICH2 to communicate between CPUs. The operation of data receiving and sending are operated and controlled by mpi4py which is based on Python. Implementation of a block predictor-corrector numerical method with one and two CPUs respectively is used to test the performance of some initial value problem. Minor speed up is obtained due to small size problems and few CPUs used in the scheme, though the establishment of this scheme by Python is valuable due to very few research has been carried in this kind of parallel structure under Python.

Advanced Android Crime Tracker

2020 ◽  
Vol 17 (8) ◽  
pp. 3643-3647
Author(s):  
Asha Pandian ◽  
Ravi Prakash ◽  
Swetabh Prakash ◽  
Kandula Rohith
Keyword(s):  
Mobile Application ◽  
The Public ◽  
Crime Investigation ◽  
The Status ◽  
Speed Up ◽  
Investigation Process ◽  
Track Status

We have proposed an advanced android crime tracker mobile application which will track the status of the investigation as well as it also tracks complaints reported by the public. The main purpose of the application is to help higher authorities like CBI and police to speed up their investigation process and track status of multiple cases at a time. In this application, public will help them to get the crime details quickly and then they can take action immediately. It will help the police to know the crime ratio in the society. This application will show all the updated crime post and once case is solved then admin can delete the post and can also update the status of investigation. Public can upload photos of crime spot and location of crime spot and photos of items found on scene. User can also post their missing person details by doing same procedure. User can also check the status updated by the admin and incase of any query or emergency; the user can chat with the police with the help of chat box. For women safety, we have provided a SOS button which will call police by clicking on that button. This application is designed in such a way that all the post which is uploaded by peoples can be seen by police also. After that they can take action immediately on it and they can write the status of the crime. This system will speed up the crime investigation process.

scholarly journals Using NViz tool for Environmental Sensor Networks

1970 ◽  
Vol 7 (1) ◽  
pp. 52-58
Author(s):  
Anh-Vu Dinh-Duc
Keyword(s):  
Sensor Networks ◽  
Development Process ◽  
Wireless Sensor ◽  
Visualization Tool ◽  
Layered Architecture ◽  
Environmental Sensor Networks ◽  
The Status ◽  
Speed Up ◽  
Environmental Sensor ◽  
Visualization Tools

Visualization tools help users to observe the status of the Wireless Sensor Networks (WSNs). Although various visualization tools have been created for certain projects so far, these tools can only be used in certain scenarios, due to their hard-coded packet formats and network’s properties. To speed up development process, a visualization tool which can adapt to any kind of WSN is essentially necessary. A generalpurpose visualization tool - NViz, which can represent and visualize data for all WSN applications, is proposed. NViz allows user to set their network’s properties and packet formats through XML files. Based on properties defined, user can choose the meaning of them and let NViz represents the data respectively. Furthermore, a better Replay mechanism, which lets researchers and developers debug their WSN easily, is also integrated in this tool. NViz is designed based on a layered architecture which allows for clear and well-defined interrelationships and interfaces between each components. As a demonstration, NViz is used for designing an environmental sensor network.

scholarly journals QUARTIC: QUick pArallel algoRithms for high-Throughput sequencIng data proCessing

F1000Research ◽  
2020 ◽  
Vol 9 ◽  
pp. 240
Author(s):  
Frédéric Jarlier ◽  
Nicolas Joly ◽  
Nicolas Fedy ◽  
Thomas Magalhaes ◽  
Leonor Sirotti ◽  
...  
Keyword(s):  
High Throughput ◽  
Message Passing ◽  
High Performance ◽  
Message Passing Interface ◽  
High Throughput Sequencing ◽  
Genome Structure ◽  
Sequencing Data ◽  
High Throughput Sequencing Data ◽  
Speed Up ◽  
Time To Delivery

Life science has entered the so-called 'big data era' where biologists, clinicians and bioinformaticians are overwhelmed with high-throughput sequencing data. While they offer new insights to decipher the genome structure they also raise major challenges to use them for daily clinical practice care and diagnosis purposes as they are bigger and bigger. Therefore, we implemented a software to reduce the time to delivery for the alignment and the sorting of high-throughput sequencing data.  Our solution is implemented using Message Passing Interface and is intended for high-performance computing architecture. The software scales linearly with respect to the size of the data and ensures a total reproducibility with the traditional tools. For example, a 300X whole genome can be aligned and sorted within less than 9 hours with 128 cores. The software offers significant speed-up using multi-cores and multi-nodes parallelization.

scholarly journals An efficient MPI/OpenMP parallelization of the Hartree–Fock–Roothaan method for the first generation of Intel® Xeon Phi™ processor architecture

2017 ◽  
Vol 33 (1) ◽  
pp. 212-224 ◽  
Author(s):  
Vladimir Mironov ◽  
Alexander Moskovsky ◽  
Michael D’Mello ◽  
Yuri Alexeev
Keyword(s):  
Message Passing ◽  
Message Passing Interface ◽  
First Generation ◽  
Hot Spot ◽  
Direct Consequence ◽  
Xeon Phi ◽  
Hartree Fock ◽  
Self Consistent Field ◽  
Speed Up ◽  
Electron Repulsion Integrals

The Hartree–Fock method in the General Atomic and Molecular Structure System (GAMESS) quantum chemistry package represents one of the most irregular algorithms in computation today. Major steps in the calculation are the irregular computation of electron repulsion integrals and the building of the Fock matrix. These are the central components of the main self consistent field (SCF) loop, the key hot spot in electronic structure codes. By threading the Message Passing Interface (MPI) ranks in the official release of the GAMESS code, we not only speed up the main SCF loop (4× to 6× for large systems) but also achieve a significant ([Formula: see text]×) reduction in the overall memory footprint. These improvements are a direct consequence of memory access optimizations within the MPI ranks. We benchmark our implementation against the official release of the GAMESS code on the Intel® Xeon Phi™ supercomputer. Scaling numbers are reported on up to 7680 cores on Intel Xeon Phi coprocessors.

Numerical Solution of 2-D Water Entry Problems Based on a CIP Method and a Parallel Computing Algorithm

2015 ◽  
Author(s):  
Peng Wen ◽  
Wei Qiu
Keyword(s):  
Parallel Computing ◽  
Message Passing ◽  
Message Passing Interface ◽  
Water Entry ◽  
Navier Stokes ◽  
Cip Method ◽  
Constrained Interpolation ◽  
Decomposition Scheme ◽  
Computing Algorithm ◽  
Speed Up

A constrained interpolation profile (CIP) method has been developed to solve 2-D water entry problems. This paper presents the further development of the numerical method using staggered grids and a parallel computing algorithm. In this work, the multi-phase slamming problems, governed by the Navier-Stokes (N-S) equations, are solved by a CIP-based finite difference method. The interfaces between different phases (solid, water and air) are captured using density functions. A parallel computing algorithm based on the Message Passing Interface (MPI) method and the domain decomposition scheme was implemented to speed up the computations. The effect of decomposition scheme on the solution and the speed-up were studied. Validation studies were carried out for the water entry of various 2-D wedges and a ship section. The predicted slamming force, pressure distribution and free surface elevation are compared with experimental results and other numerical results.

scholarly journals Information System Web-based Computer Service Case Study Datacom

2021 ◽  
Vol 6 (01) ◽  
pp. 13-20
Author(s):  
Muhammad Ichsan ◽  
Fitria Fitria
Keyword(s):  
Information System ◽  
Private Company ◽  
Web Based ◽  
Computer Data ◽  
Computer Service ◽  
Service Information ◽  
The Status ◽  
Processing Information ◽  
Speed Up ◽  
Service Data

Datacom is a private company engaged in the sale and repair of computers. Services in the datacom must be done properly and correctly to facilitate and speed up the flow of services, a computer data processing information system is very appropriate to simplify services on the datacom. This study aims to produce a computer service information system in Datacom, this system is built based on a website using the Codeigniter Framework and will be developed using the Waterfall method. Testing on this system using Blackbox Testing results in the system being able to check the status of computer service, can print service data, and can print data service reports per month.

Sign in / Sign up

Export Citation Format

Share Document