Sciweavers

38 search results - page 7 / 8
» sp 1998
Sort
View
TPDS
1998
98views more  TPDS 1998»
13 years 5 months ago
A Basic-Cycle Calculation Technique for Efficient Dynamic Data Redistribution
—Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at run-time, ther...
Yeh-Ching Chung, Ching-Hsien Hsu, Sheng-Wen Bai
TSE
1998
128views more  TSE 1998»
13 years 5 months ago
Modeling and Evaluating Design Alternatives for an On-Line Instrumentation System: A Case Study
—This paper demonstrates the use of a model-based evaluation approach for instrumentation systems (ISs). The overall objective of this study is to provide early feedback to tool ...
Abdul Waheed, Diane T. Rover, Jeffrey K. Hollingsw...
FSTTCS
2007
Springer
13 years 12 months ago
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b  2. The aim is to nd a minimum weight spannin...
Anand Srivastav, Sören Werth
ICPP
1998
IEEE
13 years 10 months ago
Performance Implications of Architectural and Software Techniques on I/O-Intensive Applications
Many large scale applications, have significant I/O requirements as well as computational and memory requirements. Unfortunately, limited number of I/O nodes provided by the conte...
Meenakshi A. Kandaswamy, Mahmut T. Kandemir, Alok ...
ICS
1998
Tsinghua U.
13 years 10 months ago
Load Execution Latency Reduction
In order to achieve high performance, contemporary microprocessors must effectively process the four major instruction types: ALU, branch, load, and store instructions. This paper...
Bryan Black, Brian Mueller, Stephanie Postal, Ryan...