Sciweavers

SC
1991
ACM
14 years 5 days ago
Interprocedural transformations for parallel code generation
We present a new approach that enables compiler optimization of procedure calls and loop nests containing procedure calls. We introduce two interprocedural transformationsthat mov...
Mary W. Hall, Ken Kennedy, Kathryn S. McKinley
SC
1991
ACM
14 years 5 days ago
Alleviation of tree saturation in multistage interconnection networks
This paper presents an examination of two distinct but complementary extensions of previous work on hot spot contention in multistage interconnection networks. The first extensio...
Matthew K. Farrens, Brad Wetmore, Allison Woodruff
SC
1991
ACM
14 years 5 days ago
Delayed consistency and its effects on the miss rate of parallel programs
In cache based multiprocessors a protocol must maintain coherence among replicated copies of shared writable data. In delayed consistency protocols the effect of out-going and in-...
Michel Dubois, Jin-Chin Wang, Luiz André Ba...
SC
1991
ACM
14 years 5 days ago
Performance results for two of the NAS parallel benchmarks
Two problems from the recently published “NAS Parallel Benchmarks” have been implemented on three advanced parallel computer systems. These two benchmarks are the following: (...
David H. Bailey, Paul O. Frederickson
ISTCS
1992
Springer
14 years 6 days ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit
GROUP
1991
ACM
14 years 6 days ago
The representation of policies as system objects
Jonathan D. Moffett, Morris Sloman
GROUP
1991
ACM
14 years 6 days ago
Extending electronic mail with conceptual modeling to provide group decision support
: This paper reports an attempt to move computer-based techniques for supporting the analysis of group cognitive processes and decision-making from being specialist applications to...
Mildred L. G. Shaw, Brian R. Gaines
FCT
1991
Springer
14 years 6 days ago
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...
Claus-Peter Schnorr, M. Euchner
FCT
1991
Springer
14 years 6 days ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini