Sciweavers

9716 search results - page 135 / 1944
» The Case for Energy-Proportional Computing
Sort
View
FCT
2001
Springer
15 years 11 months ago
Best Increments for the Average Case of Shellsort
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
Marcin Ciura
SC
2000
ACM
15 years 11 months ago
Landing CG on EARTH: A Case Study of Fine-Grained Multithreading on an Evolutionary Path
We report on our work in developing a fine-grained multithreaded solution for the communicationintensive Conjugate Gradient (CG) problem. In our recent work, we developed a simpl...
Kevin B. Theobald, Gagan Agrawal, Rishi Kumar, Ger...
HPCA
1998
IEEE
15 years 10 months ago
Exploiting Two-Case Delivery for Fast Protected Messaging
We propose and evaluate two complementary techniques to protect and virtualize a tightly-coupled network interface in a multicomputer. The techniques allow efficient, direct appli...
Kenneth Mackenzie, John Kubiatowicz, Matthew Frank...
DAC
1997
ACM
15 years 10 months ago
Methodology for Behavioral Synthesis-Based Algorithm-Level Design Space Exploration: DCT Case Study
: Numerous fast algorithms for the Discrete Cosine Transform DCT have been proposed. Until recently, it has been di cult to compare di erent DCT algorithms and select one which i...
Miodrag Potkonjak, Kyosun Kim, Ramesh Karri
FCT
2007
Springer
15 years 10 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...