Sciweavers

4894 search results - page 166 / 979
» Choices
Sort
View
PODC
1996
ACM
15 years 11 months ago
Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed co...
Maged M. Michael, Michael L. Scott
VLDB
1997
ACM
124views Database» more  VLDB 1997»
15 years 11 months ago
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
In this paper we describe novel techniques that make it possible to build an industrial-strength tool for automating the choice of indexes in the physical design of a SQL database...
Surajit Chaudhuri, Vivek R. Narasayya
MSS
1993
IEEE
62views Hardware» more  MSS 1993»
15 years 11 months ago
Striped Tape Arrays
A growing number of applications require high capacity, high throughput tertiary storage systems 1 2 . We are investigating how data striping ideas apply to arrays of magnetic tap...
Ann L. Drapeau, Randy H. Katz
PDIS
1993
IEEE
15 years 11 months ago
Nested Loops Revisited
The research communityhas considered hash-based parallel joinalgorithmsthe algorithmsof choice for almosta decade. However, almostnone ofthe commercialparallel database systems us...
David J. DeWitt, Jeffrey F. Naughton, Joseph Burge...
172
Voted
SIGCOMM
1994
ACM
15 years 11 months ago
Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and sel sh, and (2) central admini...
Scott Shenker