SIAMCOMP 2000 - PDF Preprint Papers

SIAMCOMP 2000

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SIAMCOMP-2000 Paper

click to vote

SIAMCOMP
2000

161views more SIAMCOMP 2000»

Application-Controlled Paging for a Shared Cache

13 years 10 months ago

Download www.cs.cmu.edu

We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...

Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vi...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	161	Application-Controlled Paging for a Shared Cache	claim
2	125	Approximating the Stretch Factor of Euclidean Graphs	claim
3	118	Constructive, Deterministic Implementation of Shared Memory on Meshes	claim
4	118	On Bipartite Drawings and the Linear Arrangement Problem	claim
5	109	Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph	claim
6	106	Computationally Sound Proofs	claim
7	104	On the Difficulty of Designing Good Classifiers	claim
8	104	A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction	claim
9	101	Motion Planning of Legged Robots	claim
10	101	The Complexity of the A B C Problem	claim
11	99	Squarish k-d Trees	claim
12	97	Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras	claim
13	97	Dynamic Maintenance of Maxima of 2-d Point Sets	claim
14	90	From Gene Trees to Species Trees	claim
15	88	On a Conjecture by Coffman, Flatto, and Wright on Stochastic Machine Minimization	claim
16	88	Gadgets, Approximation, and Linear Programming	claim
17	86	On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems	claim
18	85	Binary Space Partitions for Fat Rectangles	claim
19	79	Optimal Worst Case Formulas Comparing Cache Memory Associativity	claim
20	76	On Interpolation and Automatization for Frege Systems	claim
21	74	On Quiescent Reliable Communication	claim
22	74	Robust Plane Sweep for Intersecting Segments	claim
23	70	Optimal Information Gathering on the Internet with Time and Cost Constraints	claim
24	70	Early Detection of Message Forwarding Faults	claim
25	69	A Finite State Version of the Kraft--McMillan Theorem	claim
26	66	Computations of Uniform Recurrence Equations Using Minimal Memory Size	claim
27	66	Reducibility and Completeness in Private Computations	claim
28	62	A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem	claim
29	59	Quantum Entanglement and Communication Complexity	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers