Sciweavers

3104 search results - page 368 / 621
» A High Performance Kernel-Less Operating System Architecture
Sort
View
JSC
2011
99views more  JSC 2011»
14 years 6 months ago
Sparse polynomial division using a heap
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
Michael B. Monagan, Roman Pearce
EUROMICRO
2000
IEEE
15 years 8 months ago
Continuous Discrete-Event Simulation of a Continuous-Media Server I/O Subsystem
When designing computer systems, simulation tools are used to imitate a real or proposed system. Complex, dynamic systems can be simulated without the cost and time constraints in...
Michael Weeks, Chris Bailey, Reza Sotudeh
100
Voted
HICSS
2009
IEEE
101views Biometrics» more  HICSS 2009»
15 years 10 months ago
A Cost-Based Model for Improving Customer Waiting Times
The effective management of a service organization requires measuring system performance on many attributes. Customer waiting time is inherent to nearly all service operations and...
Alfred L. Guiffrida, Michael J. Messina
SOSP
2001
ACM
16 years 11 days ago
Wide-Area Cooperative Storage with CFS
The Cooperative File System (CFS) is a new peer-to-peer readonly storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file storag...
Frank Dabek, M. Frans Kaashoek, David R. Karger, R...
140
Voted
ICCS
2001
Springer
15 years 8 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick