Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
7,341
Compilation Techniques for Optimizing Communication on Distributed-Memory Systems
- In Proc. International Conference on Parallel Processing, Volume II
, 1993
"... Communication overhead can significantly impact the performance during parallel execution of programs on distributed-memory systems. In this paper we describe optimizations that reduce communication overhead and avoid execution time delays caused by interprocessor communication. The optimizations in ..."
Abstract
-
Cited by 23 (5 self)
- Add to MetaCart
Communication overhead can significantly impact the performance during parallel execution of programs on distributed-memory systems. In this paper we describe optimizations that reduce communication overhead and avoid execution time delays caused by interprocessor communication. The optimizations
Dynamical Distributed Memory Systems
"... We proposes an autonomous dynamical pattern recognition and learning system. It is demonstrated that, first, when the embedded pattern, i.e., known pattern, is given to the network, the firing pattern of the network immediately goes to the relevant embedded pattern and the network state reduces to t ..."
Abstract
- Add to MetaCart
We proposes an autonomous dynamical pattern recognition and learning system. It is demonstrated that, first, when the embedded pattern, i.e., known pattern, is given to the network, the firing pattern of the network immediately goes to the relevant embedded pattern and the network state reduces
PERFORMANCE LIMITATIONS OF BLOCK–MULTITHREADED DISTRIBUTED–MEMORY SYSTEMS
"... The performance of modern computer systems is increasingly often limited by long latencies of accesses to the memory subsystems. Instruction–level multithreading is an architectural approach to tolerating such long latencies by switching instruction threads rather than waiting for the completion of ..."
Abstract
- Add to MetaCart
of memory operations. The paper studies performance limitations in distributed–memory block multithreaded systems and determines conditions for such systems to be balanced. Event– driven simulation of a timed Petri net model of a simple distributed–memory system confirms the derived performance results. 1
On the Complexity of List Scheduling Algorithms for Distributed-Memory Systems
- ICS
, 1999
"... This paper presents a novel heuristic, called Fast Critical Path (FCP), intended as a compile-time scheduling algorithm on a distributed-memory system. While similar to existing list scheduling algorithms, FCP has two important differences: (a) it does not sort all the tasks at the beginning but mai ..."
Abstract
-
Cited by 19 (5 self)
- Add to MetaCart
This paper presents a novel heuristic, called Fast Critical Path (FCP), intended as a compile-time scheduling algorithm on a distributed-memory system. While similar to existing list scheduling algorithms, FCP has two important differences: (a) it does not sort all the tasks at the beginning
The Eden Coordination Model for Distributed Memory Systems
, 1997
"... Eden is a concurrent declarative language that aims at both the programming of reactive systems and parallel algorithms on distributed memory systems. In this paper, we explain the computation and coordination model of Eden. We show how lazy evaluation in the computation language is fruitfully combi ..."
Abstract
-
Cited by 37 (12 self)
- Add to MetaCart
Eden is a concurrent declarative language that aims at both the programming of reactive systems and parallel algorithms on distributed memory systems. In this paper, we explain the computation and coordination model of Eden. We show how lazy evaluation in the computation language is fruitfully
Compiling High Performance Fortran for distributed-memory systems
- Digital Technical Journal of Digital Equipment Corp
, 1995
"... a language for writing parallel programs. The compiler generates code for distributed-memory machines consisting of interconnected workstations or servers powered by Digital’s Alpha microprocessors. The DEC Fortran 90 compiler efficiently implements the features of Fortran 90 and HPF that support pa ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
a language for writing parallel programs. The compiler generates code for distributed-memory machines consisting of interconnected workstations or servers powered by Digital’s Alpha microprocessors. The DEC Fortran 90 compiler efficiently implements the features of Fortran 90 and HPF that support
Monitoring and Debugging Distributed Memory Systems
"... In this paper we present the objectives and design issues for two components of a parallel programming environment: a monitoring layer and a testing and debugging tool. These components are integral part of an environment that is being developed within the context of the SEPP (Software Engineeri ..."
Abstract
- Add to MetaCart
Engineering for Parallel Processing) COPERNICUS Project, investigating issues in the design and implementation of visual programming components for graph-based design of parallel programs, mapping components for specific hardware target distributed-memory architectures, simulation support tools, real
An OR Parallel Prolog Model for Distributed Memory Systems
- In PLILP
, 1993
"... This paper shows a multisequential model to exploit OR parallelism on distributed memory systems. It presents an implementation of the incremental copy mechanism oriented to distributed systems and a novel distributed scheduler is also proposed. WAM modifications to support the proposed model are ve ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
This paper shows a multisequential model to exploit OR parallelism on distributed memory systems. It presents an implementation of the incremental copy mechanism oriented to distributed systems and a novel distributed scheduler is also proposed. WAM modifications to support the proposed model
Results 1 - 10
of
7,341
