Sciweavers

5640 search results - page 1079 / 1128
» Parallelizing the Data Cube
Sort
View
JAVA
1999
Springer
14 years 1 months ago
Performance Measurement of Dynamically Compiled Java Executions
CT With the development of dynamic compilers for Java, Java’s performance promises to rival that of equivalent C/C++ binary executions. This should ensure that Java will become t...
Tia Newhall, Barton P. Miller
SIGMETRICS
1997
ACM
164views Hardware» more  SIGMETRICS 1997»
14 years 29 days ago
File Server Scaling with Network-Attached Secure Disks
By providing direct data transfer between storage and client, network-attached storage devices have the potential to improve scalability for existing distributed file systems (by...
Garth A. Gibson, David Nagle, Khalil Amiri, Fay W....
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
14 years 28 days ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
ISCA
1994
IEEE
117views Hardware» more  ISCA 1994»
14 years 27 days ago
Evaluating Stream Buffers as a Secondary Cache Replacement
Today's commodity microprocessors require a low latency memory system to achieve high sustained performance. The conventional high-performance memory system provides fast dat...
Subbarao Palacharla, Richard E. Kessler
FDL
2007
IEEE
14 years 20 days ago
Transaction Level Modelling: A reflection on what TLM is and how TLMs may be classified
Transaction-level modelling (TLM) is a poorlyterm, promising a level of abstraction like RTL (register transfer level), where the key feature is a `transaction'. But unlike r...
Mark Burton, James Aldis, Robert Günzel, Wolf...
« Prev « First page 1079 / 1128 Last » Next »