Results 1  10
of
12
Scientific Programming for Heterogeneous Systems—Bridging the Gap between Algorithms and Applications
 Proceedings of the 5th International Symposium on Parallel Computing in Electrical Engineering (PARELEC 2006
, 2006
"... High performance computing in heterogeneous environments is a dynamically developing area. A number of highly efficient heterogeneous parallel algorithms have been designed over last decade. At the same time, scientific software based on the algorithms is very much under par. The paper analyses main ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
(Show Context)
High performance computing in heterogeneous environments is a dynamically developing area. A number of highly efficient heterogeneous parallel algorithms have been designed over last decade. At the same time, scientific software based on the algorithms is very much under par. The paper analyses main issues encountered by scientific programmers during implementation of heterogeneous parallel algorithms in a portable form. It explains how programming systems can address the issues in order to maximally facilitate implementation of parallel algorithms for heterogeneous platforms and outlines two existing programming systems for high performance heterogeneous computing, mpC and HeteroMPI.
Analysis of interconnection networks in heterogeneous multicluster systems
, 2006
"... The study of interconnection networks is important because the overall performance of a distributed system is often critically hinged on the effectiveness of its interconnection network. In the mean time, the heterogeneity is one of the most important factors of such systems. This paper addresses th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
The study of interconnection networks is important because the overall performance of a distributed system is often critically hinged on the effectiveness of its interconnection network. In the mean time, the heterogeneity is one of the most important factors of such systems. This paper addresses the problem of interconnection networks performance modeling of largescale distributed systems with emphases on heterogeneous multicluster computing systems. So, we present an analytical model to predict message latency in multicluster systems in the presence of cluster size heterogeneity. The model is validated through comprehensive simulation, which demonstrates that the proposed model exhibits a good degree of accuracy for various system organizations and under different working conditions. 1.
Enhancing the Performance of Condensed Graph’s Computation in Distributed Systems by Using Numerical Libraries as Super Nodes
"... Condensed Graph is a graph based programming model which is mainly used for the modeling of imperative, eager and lazy computation and also, it is a simple way to present a workflow. The biggest advantage of CG is to detect all independent instructions (nodes) for assigning them to the different com ..."
Abstract
 Add to MetaCart
(Show Context)
Condensed Graph is a graph based programming model which is mainly used for the modeling of imperative, eager and lazy computation and also, it is a simple way to present a workflow. The biggest advantage of CG is to detect all independent instructions (nodes) for assigning them to the different computation devices in distributed and heterogeneous environments. This paper enhances the execution performance of condensed graphs in distributed systems by introducing super nodes for condensed graphs. Super nodes consist of a group of instructions treated as a single and atomic instruction. Accordingly, super nodes are more balanced in terms of computation time (Tcommunication) and communication time (Tcomputation). Therefore, the communication and computation time of the nodes can more likely happen at the same time (Toverlap) and ultimately reduces the overall graph execution time (Ttotal). In this paper, numerical libraries are used to create the super nodes. The results confirm that using super nodes with numerical libraries can have a huge impact on performance improvement in distributed systems.
1 Data Partitioning with a Realistic Performance Model of Networks of Heterogeneous Computers
"... AbstractIn this paper, we address the problem of optimal distribution of computational tasks on a network of heterogeneous computers when one or more tasks do not fit into the main memory of the processors and when relative speeds cannot be accurately approximated by constant functions of problem ..."
Abstract
 Add to MetaCart
(Show Context)
AbstractIn this paper, we address the problem of optimal distribution of computational tasks on a network of heterogeneous computers when one or more tasks do not fit into the main memory of the processors and when relative speeds cannot be accurately approximated by constant functions of problem size. We design efficient algorithms to solve the scheduling problem using a realistic performance model of network of heterogeneous computers. This model integrates many essential features of a network of heterogeneous computers having a major impact on its performance such as the processor heterogeneity, the heterogeneity of memory structure, and the effects of paging. Under this model, the speed of each processor is represented by a continuous and relatively smooth function of the size of the problem whereas standard models use single numbers to represent the speeds of the processors. We formulate a problem of partitioning of an nelement set over p heterogeneous processors using this model and design efficient algorithms for its solution whose worstcase complexity is O(p 2 ×log 2 n) but the bestcase complexity is O(p×log 2 n). Index TermsHeterogeneous systems, Scheduling and task partitioning, Load balancing and task assignment
Dynamic Graphs For The Dynamic Reconfiguration Of Groups Of Computers
"... Abstract—In the last years, the computers have increased their capacity of calculus and networks, for the interconnection of these machines, have improved until obtaining the actuals high rates of data transfering. The programs that nowadays try to take advantage of these new technologies cannot be ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—In the last years, the computers have increased their capacity of calculus and networks, for the interconnection of these machines, have improved until obtaining the actuals high rates of data transfering. The programs that nowadays try to take advantage of these new technologies cannot be written using the traditional techniques of programming, since most of the algorithms were designed for being executed in an only processor, in a nonconcurrent form instead of being executed concurrently in a set of processors working and communicating through a network. This paper aims to present the ongoing development of a new system for the reconfiguration of groupings of computers, taking into account these new technologies.
unknown title
"... Architecture based on dynamic graphs for the dynamic reconfiguration of farms of computers Abstract — In the last years, the computers have increased their capacity of calculus and networks, for the interconnection of these machines. The networks have been improved until obtaining the actual high ra ..."
Abstract
 Add to MetaCart
(Show Context)
Architecture based on dynamic graphs for the dynamic reconfiguration of farms of computers Abstract — In the last years, the computers have increased their capacity of calculus and networks, for the interconnection of these machines. The networks have been improved until obtaining the actual high rates of data transferring. The programs that nowadays try to take advantage of these new technologies cannot be written using the traditional techniques of programming, since most of the algorithms were designed for being executed in an only processor, in a nonconcurrent form instead of being executed concurrently in a set of processors working and communicating through a network. This paper aims to present the ongoing development of a new system for the reconfiguration of grouping of computers, taking into account these new technologies.
Nonintrusive and Incremental Evolution of Grid Programming Systems
, 2011
"... by ..."
(Show Context)