IPPS
1998
IEEE
14 years 4 hour ago
1998
IEEE
IPPS
1998
IEEE
14 years 4 hour ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
IPPS
1998
IEEE
14 years 4 hour ago
1998
IEEE
IPPS
1998
IEEE
14 years 4 hour ago
1998
IEEE
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
IPPS
1998
IEEE
14 years 4 hour ago
1998
IEEE
Abstract. The inherently sequential nature of random discrete eventdriven simulation has made parallel and distributed processing di cult. This paper presents a method of applying ...
IPPS
1998
IEEE
14 years 4 hour ago
1998
IEEE
IPPS
1998
IEEE
14 years 4 hour ago
1998
IEEE
The use of the DEEP development environment to analyze parallel program performance is described. The full integrated environment contains tools for the creation, analysis and deb...
IPPS
1998
IEEE
14 years 4 hour ago
1998
IEEE
Efficient performance tuning of parallel programs is often hard. In this paper we describe an approach that uses a uni-processor execution of a multithreaded program as reference ...
IPPS
1998
IEEE
14 years 4 hour ago
1998
IEEE
This paper proves tight bounds on the bisection width and expansion of butterfly networks with and without wraparound. Previously it was known that the bisection width of an n-inp...
IPPS
1998
IEEE
14 years 4 hour ago
1998
IEEE
We study the automation of the verification of Unity programs with infinite or parameterized state space. This paper presents methods allowing the transformation of some second-ord...