On the topological compatibility of parallel tasks and computing systems

2021 ◽  
Author(s):  
A. F. Zadorozhny ◽  
V. A. Melent’ev
Keyword(s):  
Parallel Computing ◽  
Comparative Analysis ◽  
Computing System ◽  
Topological Model ◽  
Present Contribution ◽  
Computing Systems ◽  
Parallel Tasks ◽  
Different Types ◽  
Types Of Information

The aspects of topological compatibility of parallel computing systems and tasks are investigated in the present contribution. Based on the original topological model of parallel computations and on the unconventional graph description by its projections, the introduction of appropriate indexes is proposed and elucidated. On the example of hypercubic computing system (CS) and tasks with ring and star information topologies, we demonstrate the determination of indexes and their use in a comparative analysis of the applicability of interconnect with a given topology to solve the tasks with the same and different types of information topologies.

A Hybrid Parallelizable Algorithm for Computer Simulation of Rigid Body Molecular Dynamics

2007 ◽  
Author(s):  
Shanzhong Duan
Keyword(s):  
Molecular Dynamics ◽  
Computer Simulation ◽  
Parallel Computing ◽  
Rigid Body ◽  
Computing System ◽  
Rigid Body Dynamics ◽  
Constraint Forces ◽  
Explicit Determination ◽  
Motion Behavior

Molecular dynamics is effective for a nano-scale phenomenon analysis. This paper presents a hybrid parallelizable algorithm for the computer simulation of the motion behavior of molecular chain and open-tree structure on parallel computing system. The algorithm is developed from an approach of rigid body dynamics, in which interbody constraints are exposed so that a system of largely independent multibody subchains is formed. The increased parallelism is obtainable through bringing interbody constraints to evidence and the explicit determination of the associated constraint forces combined with a sequential O(n) procedure. Each subchain then is assigned to a processor for parallel computing. The algorithm offers a sequential O(n) performance if there is only one processor available. The algorithm has O(log2n) computational efficiency if there are as many processors available as number for molecular bodies. For most common scenario, the algorithm will give a computational complexity between O(n) and O(log2n) if number of available processor is less than number of molecular bodies.

Parallel Computing for Mining Association Rules in Distributed P2P Networks

2011 ◽  
pp. 47-62
Author(s):  
Huiwei Guan
Keyword(s):  
Data Mining ◽  
Parallel Computing ◽  
Distributed Computing ◽  
Parallel Algorithm ◽  
Association Rules ◽  
Distributed Databases ◽  
Computing System ◽  
Computing Systems ◽  
P2p Computing ◽  
P2p Systems

Distributed computing and Peer-to-Peer (P2P) systems have emerged as an active research field that combines techniques which cover networks, distributed computing, distributed database, and the various distributed applications. Distributed Computing and P2P systems realize information systems that scale to voluminous information on very large numbers of participating nodes. Data mining on large distributed databases is a very important research area. Recently, most work for mining association rules focused on a single machine or client-server network model. However, this traditional approach does not satisfy the requirements from the large distributed databases and applications in a P2P computing system. Two important challenges are raised, one is how to implement data mining for large distributed databases in P2P computing systems, and the other is how to develop parallel data mining algorithms and tools for the distributed P2P computing systems to improve the efficiency. In this chapter, a parallel association rule mining approach in a P2P computing system is designed and implemented, which satisfies the distribution of the P2P computing system well and makes parallel computing become true. The performance and comparison of the parallel algorithm with the sequential algorithm is analyzed and evaluated, which presents the parallel algorithm features consistent implementation, higher performance, and fine scalable ability.

Parallel Computing for Mining Association Rules in Distributed P2P Networks

Data Mining ◽  
2013 ◽  
pp. 107-124
Author(s):  
Huiwei Guan
Keyword(s):  
Data Mining ◽  
Parallel Computing ◽  
Distributed Computing ◽  
Parallel Algorithm ◽  
Association Rules ◽  
Distributed Databases ◽  
Computing System ◽  
Computing Systems ◽  
P2p Computing ◽  
P2p Systems

Distributed computing and Peer-to-Peer (P2P) systems have emerged as an active research field that combines techniques which cover networks, distributed computing, distributed database, and the various distributed applications. Distributed Computing and P2P systems realize information systems that scale to voluminous information on very large numbers of participating nodes. Data mining on large distributed databases is a very important research area. Recently, most work for mining association rules focused on a single machine or client-server network model. However, this traditional approach does not satisfy the requirements from the large distributed databases and applications in a P2P computing system. Two important challenges are raised, one is how to implement data mining for large distributed databases in P2P computing systems, and the other is how to develop parallel data mining algorithms and tools for the distributed P2P computing systems to improve the efficiency. In this chapter, a parallel association rule mining approach in a P2P computing system is designed and implemented, which satisfies the distribution of the P2P computing system well and makes parallel computing become true. The performance and comparison of the parallel algorithm with the sequential algorithm is analyzed and evaluated, which presents the parallel algorithm features consistent implementation, higher performance, and fine scalable ability.

scholarly journals OPTIMIZATION OF COMPUTING PROCESS OF THE ONBOARD COMPUTING SYSTEMS

2018 ◽  
Vol 22 (2) ◽  
pp. 6-17
Author(s):  
S. V. Nazarov
Keyword(s):  
Parallel Computing ◽  
High Efficiency ◽  
Computing System ◽  
Computing Systems ◽  
Parallel Calculations ◽  
Mobile Objects ◽  
Computing Process ◽  
Special Software ◽  
Long Time ◽  
Onboard Equipment

Relevance of scope of parallel calculations was realized for a long time at the solution of complex scientific and technical challenges, as in connection with low reliability and productivity of computers, and in connection with emergence of the multiprocessor systems and multinuclear processors. The technology of ensuring reliability and high efficiency on the basis of parallel calculations naturally became prevailing in the onboard computing systems (OCS). Now such systems find broad application in aircraft and space equipment, and also in land and water mobile objects. Efficiency of performance of objectives, safety, operational suitability and some other important qualities of mobile objects considerably are defined by ability of the onboard computing system to carry out the functions. Development of the onboard equipment is characterized by constant increase in number of the solved tasks and increase of their complexity, expansion of intellectual and adaptive opportunities. It inevitably leads to complication of BVS, its operating system and the special software. For the period of the solution of the majority of the tasks assigned to BVS rigid temporary restrictions are imposed. Performance of these of the requirement results in need of the organization of parallel computing processes. In this work set of mathematical models, formulations of the tasks and approaches to their decision allowing to construct the schedule of parallel computing process for realization of the information and connected tasks on the multiprocessor onboard computing systems is presented. Models of sets of the solved tasks in the form of the loaded count and in a yarusno-parallel form, the solution of tasks on purposes of the solved tasks to processors and algorithm of drawing up the schedule of parallel computing process are given.

The Development of Compensation System in Serbia: A Comparison of Two Successive Cranet Research Rounds

2018 ◽  
Vol 56 (1) ◽  
pp. 79-90
Author(s):  
Nemanja Berber ◽  
Agneš Slavić
Keyword(s):  
Decision Making ◽  
Comparative Analysis ◽  
Theoretical Analysis ◽  
Compensation System ◽  
Decision Making Process ◽  
Compensation Management ◽  
Compensation Systems ◽  
Different Types ◽  
Compensation Packages

Abstract The aim of this paper is to explore the development of the compensation practice in the context of human resource management (HRM) in Serbia. The objectives are to detect the extent of the usage of different elements in the compensation packages, the level of negotiation during the determination of the basic pay, the responsibility for decision making process regarding basic pay, the extent of the usage of different types of benefits, and to explore the differences between these data in the two research periods, 2008-2010 and 2014-2016. The methodology in this paper includes the theoretical analysis of the compensation systems, as well as the comparative analysis of the data on compensation in Serbia based on the Cranet research. The sample of the study consisted of 210 organisations from Serbia, 50 organisations in the 2008-2010 period and 160 organisations in the 2014-2016 period. This paper brings new insights to the development of comparative compensation management since it points to the development/changes of the compensation practice (in years) in Serbian HRM.

Effect of sleep on memory for binding different types of visual information

2020 ◽  
Author(s):  
John J Shaw ◽  
Zhisen Urgolites ◽  
Padraic Monaghan
Keyword(s):  
Visual Information ◽  
Storage Capacity ◽  
Declarative Memory ◽  
Recognition Task ◽  
Forced Choice ◽  
Long Term Memory ◽  
Term Memory ◽  
Different Types ◽  
Types Of Information

Visual long-term memory has a large and detailed storage capacity for individual scenes, objects, and actions. However, memory for combinations of actions and scenes is poorer, suggesting difficulty in binding this information together. Sleep can enhance declarative memory of information, but whether sleep can also boost memory for binding information and whether the effect is general across different types of information is not yet known. Experiments 1 to 3 tested effects of sleep on binding actions and scenes, and Experiments 4 and 5 tested binding of objects and scenes. Participants viewed composites and were tested 12-hours later after a delay consisting of sleep (9pm-9am) or wake (9am-9pm), on an alternative forced choice recognition task. For action-scene composites, memory was relatively poor with no significant effect of sleep. For object-scene composites sleep did improve memory. Sleep can promote binding in memory, depending on the type of information to be combined.

Characterization of Different Types of Biomass Wastes Using Thermogravimetric and ICP-MS Analyses

2020 ◽  
Vol 70 (12) ◽  
pp. 4594-4600
Keyword(s):  
Thermogravimetric Analysis ◽  
Food Industry ◽  
Wood Waste ◽  
Biomass Ash ◽  
Minor Elements ◽  
Ms Analysis ◽  
Icp Ms ◽  
Different Types

The purpose of this study was to characterize some types of biomass wastes resulted from different activities such as: agriculture, forestry and food industry using thermogravimetric and ICP-MS analyses. Also, it was optimized an ICP-MS method for the determination of As, Cd and Pb from biomass ash samples. The ICP-MS analysis revealed that the highest concentration of metals (As, Cd, Pb) was recorded in the wood waste ash sample, also the thermogravimetric analysis indicated that the highest amount of ash was obtained for the same sample (26.82%). The biomass wastes mentioned in this study are alternative recyclable materials, reusable as pellets and briquettes. Keywords: ash, biomass, ICP-MS, minor elements, TG

Studies on the Behavior Some Paints in Electro-insulating Fluid Based on Vegetable Esters

2018 ◽  
Vol 69 (5) ◽  
pp. 1139-1144
Author(s):  
Iosif Lingvay ◽  
Adriana Mariana Bors ◽  
Livia Carmen Ungureanu ◽  
Valerica Stanoi ◽  
Traian Rus
Keyword(s):  
Structural Changes ◽  
Oxidation Processes ◽  
High Oleic ◽  
Painting Materials ◽  
Insulating Paper ◽  
Different Types ◽  
Mechanism And Kinetics ◽  
Kinetics Of ◽  
Natural Ester

For the purpose of using three different types of painting materials for the inner protection of the transformer vats, their behavior was studied under actual conditions of operation in the transformer (thermal stress in electro-insulating fluid based on the natural ester in contact with copper for electro-technical use and electro-insulating paper). By comparing determination of the content in furans products (HPLC technique) and gases formed (by gas-chromatography) in the electro-insulating fluid (natural ester with high oleic content) thermally aged at 130 �C to 1000 hours in closed glass vessels, it have been found that the presence the investigated painting materials lead to a change in the mechanism and kinetics of the thermo-oxidation processes. These changes are supported by oxygen dissolved in oil, what leads to decrease both to gases formation CO2, CO, H2, CH4, C2H4 and C2H6) and furans products (5-HMF, 2-FOL, 2 -FAL and 2-ACF). The painting materials investigated during the heat treatment applied did not suffer any remarkable structural changes affecting their functionality in the electro-insulating fluid based on vegetable esters.

Sign in / Sign up

Export Citation Format

Share Document