A Portable, High-Level Graph Analytics Framework Targeting Distributed, Heterogeneous Systems

2016 ◽  
Author(s):  
Robert Searles ◽  
Stephen Herbein ◽  
Sunita Chandrasekaran
Keyword(s):  
Heterogeneous Systems ◽  
Graph Analytics ◽  
High Level

A User-oriented Protocol for Integrating Heterogeneous Communication Systems of Medical Facilities Using Ports

1989 ◽  
Vol 28 (02) ◽  
pp. 97-103 ◽  
Author(s):  
L. GierI ◽  
R. Greiller ◽  
Th. Landersdorfer ◽  
H. Müller ◽  
K. Überla
Keyword(s):  
Information Exchange ◽  
Message Passing ◽  
Communication Systems ◽  
Heterogeneous Systems ◽  
Medical Facilities ◽  
Complex Functions ◽  
Data Objects ◽  
Definition Of ◽  
The Individual ◽  
High Level

Abstract:The crucial feature of future communication systems in hospitals will be the heterogeneity between the individual systems. People working in a hospital do not communicate via data objects, but via highly complex functions like preparation of a patient report or diagnosis of patients’ symptoms and signs. Essentially such tasks are accomplished by initiating remote functions in various modes of a communication system. The aim of the MEDAS protocol developed by our group is to propose a definition of such a high-level medical protocol and then to implement it. Our user-oriented protocol permits information exchange between heterogeneous systems. Modules and functions are defined. Message passing to and from a processor is realized using ports. The protocol sequence of every communication request is described. The relation of ports to the ISO model is specified. First experiences in a network for a medical school are reported.

A high-level compilation toolchain for heterogeneous systems

2009 ◽  
Author(s):  
W. Luk ◽  
J.G.F. Coutinho ◽  
T. Todman ◽  
Y.M. Lam ◽  
W. Osborne ◽  
...  
Keyword(s):  
Heterogeneous Systems ◽  
High Level

Creating a portable, high-level graph analytics paradigm for compute and data-intensive applications

2017 ◽  
Vol 1 (1) ◽  
pp. 1
Author(s):  
Robert Searles ◽  
Michela Taufer ◽  
Sunita Chandrasekaran ◽  
Stephen Herbein ◽  
Travis Johnston
Keyword(s):  
Graph Analytics ◽  
Data Intensive ◽  
High Level ◽  
Data Intensive Applications

scholarly journals A Skeleton Based Programming Paradigm for Mobile Multi-Agents on Distributed Systems and Its Realization within the MAGDA Mobile Agents Platform

2008 ◽  
Vol 4 (2) ◽  
pp. 131-146 ◽  
Author(s):  
R. Aversa ◽  
B. Di Martino ◽  
N. Mazzocca ◽  
S. Venticinque
Keyword(s):  
Parallel Programming ◽  
Mobile Agent ◽  
Heterogeneous Systems ◽  
Distributed Applications ◽  
Programming Environment ◽  
Agent Based ◽  
Workload Balancing ◽  
Programming Effort ◽  
High Level ◽  
Multi Agents

Parallel programming effort can be reduced by using high level constructs such as algorithmic skeletons. Within the MAGDA toolset, supporting programming and execution of mobile agent based distributed applications, we provide a skeleton-based parallel programming environment, based on specialization of Algorithmic Skeleton Java interfaces and classes. Their implementation include mobile agent features for execution on heterogeneous systems, such as clusters of WSs and PCs, and support reliability and dynamic workload balancing. The user can thus develop a parallel, mobile agent based application by simply specialising a given set of classes and methods and using a set of added functionalities.

CuSP

2021 ◽  
Vol 55 (1) ◽  
pp. 47-60
Author(s):  
Loc Hoang ◽  
Roshan Dathathri ◽  
Gurbinder Gill ◽  
Keshav Pingali
Keyword(s):  
Single Machine ◽  
Distributed Memory ◽  
The State ◽  
Main Memory ◽  
Input Graph ◽  
Large Graphs ◽  
Graph Analytics ◽  
Graph Partitions ◽  
High Level ◽  
Edge Partitioning

Graph analytics systems must analyze graphs with billions of vertices and edges which require several terabytes of storage. Distributed-memory clusters are often used for analyzing such large graphs since the main memory of a single machine is usually restricted to a few hundreds of gigabytes. This requires partitioning the graph among the machines in the cluster. Existing graph analytics systems use a built-in partitioner that incorporates a particular partitioning policy, but the best policy is dependent on the algorithm, input graph, and platform. Therefore, built-in partitioners are not sufficiently flexible. Stand-alone graph partitioners are available, but they too implement only a few policies. CuSP is a fast streaming edge partitioning framework which permits users to specify the desired partitioning policy at a high level of abstraction and quickly generates highquality graph partitions. For example, it can partition wdc12, the largest publicly available web-crawl graph with 4 billion vertices and 129 billion edges, in under 2 minutes for clusters with 128 machines. Our experiments show that it can produce quality partitions 6× faster on average than the state-of-theart stand-alone partitioner in the literature while supporting a wider range of partitioning policies.

scholarly journals Grafs: declarative graph analytics

2021 ◽  
Vol 5 (ICFP) ◽  
pp. 1-32
Author(s):  
Farzin Houshmand ◽  
Mohsen Lesani ◽  
Keval Vora
Keyword(s):  
High Performance ◽  
Large Scale ◽  
Kernel Functions ◽  
Runtime Systems ◽  
Graph Processing ◽  
Large Graphs ◽  
Graph Analytics ◽  
Efficient Code ◽  
High Level ◽  
Abstract Interface

Graph analytics elicits insights from large graphs to inform critical decisions for business, safety and security. Several large-scale graph processing frameworks feature efficient runtime systems; however, they often provide programming models that are low-level and subtly different from each other. Therefore, end users can find implementation and specially optimization of graph analytics error-prone and time-consuming. This paper regards the abstract interface of the graph processing frameworks as the instruction set for graph analytics, and presents Grafs, a high-level declarative specification language for graph analytics and a synthesizer that automatically generates efficient code for five high-performance graph processing frameworks. It features novel semantics-preserving fusion transformations that optimize the specifications and reduce them to three primitives: reduction over paths, mapping over vertices and reduction over vertices. Reductions over paths are commonly calculated based on push or pull models that iteratively apply kernel functions at the vertices. This paper presents conditions, parametric in terms of the kernel functions, for the correctness and termination of the iterative models, and uses these conditions as specifications to automatically synthesize the kernel functions. Experimental results show that the generated code matches or outperforms handwritten code, and that fusion accelerates execution.

scholarly journals Approximation Algorithm for Scheduling a Chain of Tasks for Motion Estimation on Heterogeneous Systems MPSoC

2021 ◽  
Author(s):  
Afef Salhi ◽  
Fahmi Ghozzi ◽  
Ahmed Fakhfakh
Keyword(s):  
Embedded System ◽  
Execution Time ◽  
Heterogeneous Systems ◽  
Video Codec ◽  
Software Models ◽  
Multiprocessor Soc ◽  
Consumption Energy ◽  
A Chain ◽  
High Level

Co-design embedded system are very important step in digital vehicle and airplane. The multicore and multiprocessor SoC (MPSoC) started a new computing era. It is becoming increasingly used because it can provide designers much more opportunities to meet specific performances. Designing embedded systems includes two main phases: (i) HW/SW Partitioning performed from high-level (eclipse C/C++ or python (machine learning and deep learning)) functional and architecture models (with virtual prototype and real prototype). And (ii) Software Design performed with significantly more detailed models with scheduling and partitioning tasks algorithm DAG Directed Acyclic Graph and GGEN Generation Graph Estimation Nodes (there are automatic DAG algorithm). Partitioning decisions are made according to performance assumptions that should be validated on the more refined software models for ME block and GGEN algorithm. In this paper, we focus to optimize a execution time and amelioration for quality of video with a scheduling and partitioning tasks in video codec. We show how they can be modeled the video sequence test with the size of video in height and width (three models of scheduling tasks in four processor). This modeling with DAG and GGEN are partitioning at different platform in OVP (partitioning, SW design). We can know the optimization of consumption energy and execution time in SoC and MPSoC platform.

scholarly journals The pulsed subcritical amplifier of neutron flux driven by high-intensity neutron generator

2019 ◽  
Vol 34 (1) ◽  
pp. 1-12
Author(s):  
Vladimir Babenko ◽  
Volodymyr Pavlovych ◽  
Volodymyr Gulik
Keyword(s):  
Neutron Flux ◽  
Heterogeneous Systems ◽  
High Energy ◽  
Energy Applications ◽  
Nuclear Models ◽  
In Series ◽  
Initial Source ◽  
High Level ◽  
Energy Amplification ◽  
Subcritical Reactor

The subcritical reactor driven by external neutron source could apply as useful instrument for modern nuclear energy applications requiring high-level irradiation of different materials by the high-energy and high-intense neutron flux (e. g., nuclear waste transmutation, radiopharmaceutical production, etc.). The propagation of neutron pulses through the subcritical nuclear system was considered in the present paper. Simple homogeneous subcritical systems and a model of two-zone subcritical reactor were computationally investigated using Monte Carlo MCNP4c transport code. The propagation of one initial neutron pulse and series of one hundred neutron pulses through the presented subcritical nuclear models were simulated. In this study, the neutron multiplication factor, the neutron flux, the energy amplification factor, the total energy of neutrons in initial pulse, etc. were obtained and analyzed. The presented calculations have shown that the considered pulse subcritical systems can be successfully used as effective amplifiers of neutron flux from the initial source. The modeling results indicate that there is an achievement of a stable, high level of neutron flux caused by the accumulation of delayed neutrons from previous pulses in series of one hundred pulses for both homogeneous and heterogeneous systems.

Sign in / Sign up

Export Citation Format

Share Document