Filters








70,792 Hits in 8.2 sec

Distributed and parallel systems and HOOD4 [chapter]

Rainer Gerlich, Mladen Kerep
1996 Lecture Notes in Computer Science  
For distributed and parallel computing the new version of HOOD, HOOD4 [1], brings a significant advantage: it decouples the logical design from the partitioning required to map software onto a net of processors  ...  The HOOD4 concept for support of distributed systems was defined during the SOFTPAR project [2] by customising approaches for migration of software [3, 4] and for real-time processing [5] .  ...  In summary, much experience was gained in applying HOOD4 for parallel and distributed systems and for optimisation of system configuration.  ... 
doi:10.1007/bfb0015498 fatcat:r4vjicm4azfppp6ko4eqshldte

A progressive approach to handling message-dependent deadlock in parallel computer systems

Yong Ho Song, T.M. Pinkston
2003 IEEE Transactions on Parallel and Distributed Systems  
Handling deadlocks is essential for providing reliable communication paths between processing nodes in parallel computer systems.  ...  Index Terms-Interconnection network, deadlock-free routing, message dependency, parallel processing. ae 1 INTRODUCTION I N parallel computer systems, efficient and reliable communication among processing  ...  ACKNOWLEDGMENTS The research described in this paper was supported, in part, by the US National Science Foundation (NSF) grants CCR 9812137 and CCR 0209234.  ... 
doi:10.1109/tpds.2003.1189584 fatcat:ptwt32tflngsllwfpifhhhcrci

System Design and Algorithmic Development for Computational Steering in Distributed Environments

Qishi Wu, Mengxia Zhu, Yi Gu, Nageswara S.V. Rao
2010 IEEE Transactions on Parallel and Distributed Systems  
We propose a remote computational steering system that employs analytical models to estimate the cost of computing and communication components and optimizes the overall system performance in distributed  ...  The superior performance of the proposed solution is demonstrated with extensive simulation results in comparison with existing algorithms and is further evidenced by experimental results collected on  ...  ACKNOWLEDGMENTS The authors would like to thank Anne Benoit and Yves Robert at ENS Lyon for their help with the NP-completeness proof.  ... 
doi:10.1109/tpds.2009.81 fatcat:kfvhs3gemnd2nbov6uvqmwfrfu

Snap-stabilization in message-passing systems

Sylvie Delaët, Stéphane Devismes, Mikhail Nesterenko, Sébastien Tixeuil
2010 Journal of Parallel and Distributed Computing  
In this paper, we tackle the problem of snap-stabilization in message-passing systems.  ...  Our contribution is twofold: we demonstrate that in message passing systems (i) snap-stabilization is impossible for nontrivial problems if channels are of finite yet unbounded capacity, and (ii) snap-stabilization  ...  A process is an asynchronous sequential deterministic machine that uses a local memory, a local algorithm, and input/output capabilities.  ... 
doi:10.1016/j.jpdc.2010.04.002 fatcat:l22evf6rezdstmfmynanhctxja

Reliability of Heterogeneous Distributed Computing Systems in the Presence of Correlated Failures

Jorge E. Pezoa, Majeed M. Hayat
2014 IEEE Transactions on Parallel and Distributed Systems  
While the reliability of distributed-computing systems (DCSs) has been widely studied under the assumption that computing elements (CEs) fail independently, the impact of correlated failures of CEs on  ...  The reliability model is further utilized to develop and optimize a novel class of dynamic task reallocation (DTR) policies that maximize the reliability of DCSs in the presence of correlated failures.  ...  OF HETEROGENEOUS DISTRIBUTED COMPUTING SYSTEMS IN THE PRESENCE OF...  ... 
doi:10.1109/tpds.2013.78 fatcat:4t22ps5oazgqbgtwm34udjrhdi

A unified framework for optimizing locality, parallelism, and communication in out-of-core computations

M. Kandemir, A. Choudhary, J. Ramanujam, M.A. Kandaswamy
2000 IEEE Transactions on Parallel and Distributed Systems  
Index TermsÐI/O-intensive codes, optimizing compilers, loop and data transformations, out-of-core computations, file layouts. ae 648  ...  Our approach considers array references one-by-one and attempts to optimize each reference for parallelism and locality.  ...  His research interests are in compilers for highperformance computer systems, program transformations, embedded systems, high-level hardware synthesis, parallel input/output systems, parallel architectures  ... 
doi:10.1109/71.877759 fatcat:ss3bvfcebren5fup2sc3brujui

Scalable linear programming based resource allocation for makespan minimization in heterogeneous computing systems

Kyle M. Tarplee, Ryan Friese, Anthony A. Maciejewski, Howard Jay Siegel
2015 Journal of Parallel and Distributed Computing  
The new algorithms are highly scalable in terms of solution quality and computation time as the problem size increases because they leverage similarity in tasks and machines.  ...  In this study, we design a novel linear programming based resource allocation algorithm for heterogeneous computing systems to efficiently compute high quality solutions for minimizing makespan.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.  ... 
doi:10.1016/j.jpdc.2015.07.002 fatcat:qqw46bvygrgpzhfwm56m6zzukq

Synergies in scientific computing by combining multi-paradigmatic languages for high-performance applications

Philipp Schwaha, René Heinzl, Franz Stimpfl, Siegfried Selberherr
2009 International Journal of Parallel, Emergent and Distributed Systems  
Several generic components and modules for application design in the area of scientific computing are presented.  ...  Thereby data structures and algorithms realised in Cþþ using features such as compile-time meta-programming are made available to the run-time environment of Python.  ...  , Emergent and Distributed Systems  ... 
doi:10.1080/17445760902758552 fatcat:k7s2idfzufefzncgyclutcpebe

Designing and implementing service framework for virtual agents in home network system

Hiroyasu Horiuchi, Sachio Saiki, Shinsuke Matsumoto, Masahide Nakamura
2014 15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)  
In order to achieve intuitive and easy operations for home network system (HNS), we have previously proposed user interface with virtual agent (called HNS virtual agent user interface, HNS-VAUI).  ...  Specifically, we decompose the tightly-coupled system into two separate services: MMC Service and MSM service.  ...  A pair of input/output messages (with the same label) synchronizes state transitions of two FSMs. The flow control works as follows.  ... 
doi:10.1109/snpd.2014.6888728 dblp:conf/snpd/HoriuchiSMN14 fatcat:jsebvdi66fawxb6fegv3kdhvnq

Many Task Computing for Real-Time Uncertainty Prediction and Data Assimilation in the Ocean

C Evangelinos, P F J Lermusiaux, Jinshan Xu, P J Haley, C N Hill
2011 IEEE Transactions on Parallel and Distributed Systems  
We study the execution characteristics and challenges of a distributed ESSE workflow on a large dedicated cluster and the usability of enhancing this with runs on Amazon EC2 and the Teragrid and the I/  ...  The resulting ocean fields are provided as the input to acoustic modeling, allowing for the prediction and study of the spatiotemporal variations in acoustic propagation.  ...  CE and CNH are grateful to the NSF for support and Amazon for an educational grant.  ... 
doi:10.1109/tpds.2011.64 fatcat:cb3fr3ohrnc3dm4crcky3ih4fq

Journeys in non-classical computation I: A grand challenge for computing research

Susan Stepney, Samuel L. Braunstein, John A. Clark, Andy Tyrrell, Andrew Adamatzky, Robert E. Smith, Tom Addis, Colin Johnson, Jonathan Timmis, Peter Welch, Robin Milner, Derek Partridge
2005 International Journal of Parallel, Emergent and Distributed Systems  
.), and dropping Euclid's parallel postulate. A gateway event produces a profound and fundamental change to the system: Once through the gateway, life is never the same again.  ...  that leads to the possibility of huge increases in kinds and levels of complexity.  ...  This input-output mapping is a logical property of the computation, and is all that is important: No intermediate states are of interest, the computation is independent of physical realisation, and different  ... 
doi:10.1080/17445760500033291 fatcat:kvtkuff7cfabjke3lmnibkgi5m

Analyzing the Energy-Time Trade-Off in High-Performance Computing Applications

Vincent W. Freeh, David K. Lowenthal, Feng Pan, Nandini Kappiah, Rob Springer, Barry L. Rountree, Mark E. Femal
2007 IEEE Transactions on Parallel and Distributed Systems  
Although users of high-performance computing are most interested in raw performance, both energy and power consumption have become critical concerns.  ...  This paper analyzes the energy-time trade-off of a wide range of applications-serial and parallel-on a power-scalable cluster.  ...  It is an evolution of several existing methods including basic input/output system (BIOS) power management, the Advanced Power Management (APM) API, and a smart battery interface.  ... 
doi:10.1109/tpds.2007.1026 fatcat:qlbutplhuvcedcyik5ol4nsd6u

Collective input/output under memory constraints

Yin Lu, Yong Chen, Yu Zhuang, Jialin Liu, Rajeev Thakur
2014 The international journal of high performance computing applications  
Compared with current high-performance computing (HPC) systems, exascale systems are expected to have much less memory per node, which can significantly reduce necessary collective input/output (I/O) performance  ...  In this study, we introduce a memory-conscious collective I/O strategy that takes into account memory capacity and bandwidth constraints.  ...  Acknowledgements We acknowledge the High Performance Computing Center (HPCC) at Texas Tech University at Lubbock for providing HPC resources that have contributed to the research results reported in this  ... 
doi:10.1177/1094342014561696 fatcat:hjccbkbxozeadaanwkz6vvzwqe

Input/output characteristics of scalable parallel applications

Phyllis E. Crandall, Ruth A. Aydt, Andrew A. Chien, Daniel A. Reed
1995 Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '95  
Rapid increases in computing and communication performance are exacerbating the long-standing problem of performance-limited input/output.  ...  The design of scalable input/output systems depends critically on the input/output requirements and access patterns for this emerging class of large-scale parallel applications.  ...  Acknowledgments We thank the members of the Scalable I/O Initiative who provided us with the applications examined in this paper. In particular, the elec-  ... 
doi:10.1145/224170.224396 dblp:conf/sc/CrandallACR95 fatcat:m7oxxjlcdbhjrpz5leyg2nm6gy

Informed prefetching of collective input/output requests

Tara M. Madhyastha, Garth A. Gibson, Christos Faloutsos
1999 Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '99  
Optimizing collective input/output (I/O) is important for improving throughput of parallel scientific applications.  ...  In this paper we propose and analyze a method of optimizing collective access patterns using informed prefetching that is capable of exploiting any amount of available memory to overlap I/O with computation  ...  Figure 1 : 1 System architecture. Compute nodes and input/output nodes (each of which manages a disk or disk array) communicate through a fast network interconnect.  ... 
doi:10.1145/331532.331545 dblp:conf/sc/MadhyasthaGF99 fatcat:edlf55vnuvf5jmatowgup2ngvu
« Previous Showing results 1 — 15 out of 70,792 results