1. Home
  2. Proceedings
  3. CLUSTER
  4. CLUSTER 2001
Default Cover Image

Third IEEE International Conference on Cluster Computing (CLUSTER'01)

Oct. 8 2001 to Oct. 11 2001

Newport Beach, CA

ISBN: 0-7695-1116-3

Table of Contents

2001 IEEE International Conference On Cluster Computing [front matter]Freely available from IEEE.pp. i,ii,iii,iv,v,vi,vii,viii,ix,x
42nd IEEE Symposium on Foundations of Computer Science [front matter]Freely available from IEEE.pp. i-viii
Game theory and mathematical economics: a theoretical computer scientist's introductionFull-text access may be available. Sign in or learn about subscription options.pp. 4-8
by C.H. Papadimitriou
Algorithmic applications of low-distortion geometric embeddingsFull-text access may be available. Sign in or learn about subscription options.pp. 10-33
by P. Indyk
Coding theory: Tutorial & surveyFull-text access may be available. Sign in or learn about subscription options.pp. 36-53
by M. Sudan
Almost tight upper bounds for vertical decompositions in four dimensionsFull-text access may be available. Sign in or learn about subscription options.pp. 56-65
by V. Koltun
Approximate shape fitting via linearizationFull-text access may be available. Sign in or learn about subscription options.pp. 66-73
by S. Har-Peled, K.R. Varadarajan
On the complexity of many faces in arrangements of circlesFull-text access may be available. Sign in or learn about subscription options.pp. 74-83
by P.K. Agarwal, B. Aronov, M. Sharir
Clustering motionFull-text access may be available. Sign in or learn about subscription options.pp. 84-93
by S. Har-Peled
A replacement for Voronoi diagrams of near linear sizeFull-text access may be available. Sign in or learn about subscription options.pp. 94-103
by S. Har-Peled
How to go beyond the black-box simulation barrierFull-text access may be available. Sign in or learn about subscription options.pp. 106-115
by B. Barak
Resettably-sound zero-knowledge and its applicationsFull-text access may be available. Sign in or learn about subscription options.pp. 116-125
by B. Barak, O. Goldreich, S. Goldwasser, Y. Lindell
On the impossibility of basing trapdoor functions on trapdoor predicatesFull-text access may be available. Sign in or learn about subscription options.pp. 126-135
by Y. Gertner, T. Malkin, O. Reingold
Universally composable security: a new paradigm for cryptographic protocolsFull-text access may be available. Sign in or learn about subscription options.pp. 136-145
by R. Canetti
Traveling with a Pez dispenser (or, routing issues in MPLS)Full-text access may be available. Sign in or learn about subscription options.pp. 148-157
by A. Gupta, A. Kumar, R. Rastogi
Simple routing strategies for adversarial systemsFull-text access may be available. Sign in or learn about subscription options.pp. 158-167
by B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler
Source routing and scheduling in packet networksFull-text access may be available. Sign in or learn about subscription options.pp. 168-177
by M. Andrews, A. Fernandez, A. Goel, L. Zhang
The natural work-stealing algorithm is stableFull-text access may be available. Sign in or learn about subscription options.pp. 178-187
by P. Berenbrink, T. Friedetzky, L.A. Goldberg
Message from the Task Force Co-ChairsFreely available from IEEE.pp. xi
Lower bounds for polynomial calculus: non-binomial caseFull-text access may be available. Sign in or learn about subscription options.pp. 190-199
by M. Alekhnovich, A.A. Razborov
Message from the Conference General Co-ChairsFreely available from IEEE.pp. xiii
Message from the Program ChairsFreely available from IEEE.pp. xv
Counting axioms do not polynomially simulate counting gatesFull-text access may be available. Sign in or learn about subscription options.pp. 200-209
by R. Impagliazzo, N. Segerlind
IEEE Cluster 2001 Conference Organization CommitteeFreely available from IEEE.pp. xvii
Resolution is not automatizable unless W[P] is tractableFull-text access may be available. Sign in or learn about subscription options.pp. 210-219
by M. Alekhnovich, A.A. Razboro
"Planar" tautologies hard for resolutionFull-text access may be available. Sign in or learn about subscription options.pp. 220-229
by S. Dantchev, S. Riis
Cluster 2001 Technical Program CommitteeFreely available from IEEE.pp. xix
Keynote
"Architecture Recapitulates Phylogeny": How Scalability Requires SpecializationFull-text access may be available. Sign in or learn about subscription options.pp. 3
by S. Oberlin
Planar graphs, negative weight edges, shortest paths, and near linear timeFull-text access may be available. Sign in or learn about subscription options.pp. 232-241
by J. Fakcharoenphol, S. Rao
Compact oracles for reachability and approximate distances in planar digraphsFull-text access may be available. Sign in or learn about subscription options.pp. 242-251
by M. Thorup
Networking I
Early Experiences with the Myricom 2000 Switch on an SMP Beowulf-Class Cluster for Unstructured Adaptive MeshingFull-text access may be available. Sign in or learn about subscription options.pp. 7
by Charles D. Norton, Thomas A. Cwik
Networking I
Using Multirail Networks in High-Performance ClustersFull-text access may be available. Sign in or learn about subscription options.pp. 15
by Salvador Coll, Eitan Frachtenberg, Fabrizio Petrini, Adolfy Hoisie, Leonid Gurvits
Vickrey prices and shortest paths: what is an edge worth?Full-text access may be available. Sign in or learn about subscription options.pp. 252-259
by J. Hershberger, S. Suri
Fully dynamic all pairs shortest paths with real edge weightsFull-text access may be available. Sign in or learn about subscription options.pp. 260-267
by C. Demetrescu, G.F. Italiano
I/O
Next Generation Parallel Virtual File System (invited)Full-text access may be available. Sign in or learn about subscription options.pp. 27
by W. Ligon
I/O
Experiences with Oasis+: A Fault Tolerant Storage SystemFull-text access may be available. Sign in or learn about subscription options.pp. 29
by D. Watson, Y. Luo, B. D. Fleisch
Informational complexity and the direct sum problem for simultaneous message complexityFull-text access may be available. Sign in or learn about subscription options.pp. 270-278
by A. Chakrabarti, Yaoyun Shi, A. Wirth, A. Yao
I/O
Clusterfile: A Flexible Physical Layout Parallel File SystemFull-text access may be available. Sign in or learn about subscription options.pp. 37
by Florin Isaila, Walter F. Tichy
How powerful is adiabatic quantum computation?Full-text access may be available. Sign in or learn about subscription options.pp. 279-287
by W. van Dam, M. Mosca, U. Vazirani
Cluster Management I
High Performance Computing with Microsoft Windows 2000Full-text access may be available. Sign in or learn about subscription options.pp. 47
by David A. Lifka
Lower bounds for quantum communication complexityFull-text access may be available. Sign in or learn about subscription options.pp. 288-297
by H. Klauck
Cluster Management I
GulfStream - a System for Dynamic Topology Management in Multi-domain Server FarmsFull-text access may be available. Sign in or learn about subscription options.pp. 55
by Sameh A. Fakhouri, Germán Goldszmidt, Michael Kalantar, John A. Pershing, Indranil Gupta
The confluence of ground term rewrite systems is decidable in polynomial timeFull-text access may be available. Sign in or learn about subscription options.pp. 298-307
by H. Comon, G. Godoy, R. Nieuwenhuis
Cluster Management I
Cluster Rolling Upgrade using Multiple Version SupportFull-text access may be available. Sign in or learn about subscription options.pp. 63
by Ellard T. Roush
On the average-case hardness of CVPFull-text access may be available. Sign in or learn about subscription options.pp. 308-317
by Jin-Yi Cai
Alternative Hardware
Dense Computing with Transmeta's Crusoe (invited)Full-text access may be available. Sign in or learn about subscription options.pp. 73
by D. Gaudet
Approximating directed multicutsFull-text access may be available. Sign in or learn about subscription options.pp. 320-328
by J. Cheriyan, H. Karloff, Y. Rabani
Facility location with nonuniform hard capacitiesFull-text access may be available. Sign in or learn about subscription options.pp. 329-338
by M. Pal, T. Tardos, T. Wexler
Alternative Hardware
PVL: An Object Oriented Software Library for Parallel Signal Processing (invited)Full-text access may be available. Sign in or learn about subscription options.pp. 74
by E. Rutledge, J. Kepner
An iterative rounding 2-approximation algorithm for the element connectivity problemFull-text access may be available. Sign in or learn about subscription options.pp. 339-347
by L. Fleischer, K. Jain, D.P. Williamson
Alternative Hardware
Numerically-Intensive "Plug-and-Play" Parallel ComputingFull-text access may be available. Sign in or learn about subscription options.pp. 75
by Dean E. Dauger, Viktor K. Decyk
Approximation algorithms for the job interval selection problem and related scheduling problemsFull-text access may be available. Sign in or learn about subscription options.pp. 348-356
by J. Chuzhoy, R. Ostrovsky
Applications I
Parallel Standard Cell Placement on a Cluster of WorkstationsFull-text access may be available. Sign in or learn about subscription options.pp. 85
by Faris H. Khundakjie, Patick H. Madden, Nael B. Abu-Ghazaleh, Mehmet Can Yildiz
Lower bounds for matrix productFull-text access may be available. Sign in or learn about subscription options.pp. 358-367
by A. Shpilka
Applications I
Stingray: Cone tracing using a software DSM for SCI clustersFull-text access may be available. Sign in or learn about subscription options.pp. 95
by Alexandre Meyer, Emmanuel Cecchet
Deterministic computation of the Frobenius formFull-text access may be available. Sign in or learn about subscription options.pp. 368-377
by A. Storjohann
Applications I
Parallel and Adaptive Reduction of Hyperspectral Data to Intrinsic DimensionalityFull-text access may be available. Sign in or learn about subscription options.pp. 102
by Tarek El-Ghazawi, Sinthop Kaewpijit, Jacqueline Le Moigne
The complexity of factors of multivariate polynomialsFull-text access may be available. Sign in or learn about subscription options.pp. 378-385
by P. Burgisser
Scheduling
Workload Management: More Than Just Job SchedulingFull-text access may be available. Sign in or learn about subscription options.pp. 113
by James Patton Jones, Bill Nitzberg, Bob Henderson
Linear-time recognition of circular-arc graphsFull-text access may be available. Sign in or learn about subscription options.pp. 386-394
by R.M. McConnell
Scheduling
Scheduling parallel adaptive applications in networks of workstations and clusters of processorsFull-text access may be available. Sign in or learn about subscription options.pp. 116
by D. Kebbal, E.-G. Talbi, J.-M. Geib
A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problemsFull-text access may be available. Sign in or learn about subscription options.pp. 396-405
by Y. Bartal, B. Bollobas, M. Mendel
Scheduling
Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not BetterFull-text access may be available. Sign in or learn about subscription options.pp. 124
by Arnold L. Rosenberg
Designing networks incrementallyFull-text access may be available. Sign in or learn about subscription options.pp. 406-415
by A. Meyerson, K. Munagala, S. Plotkin
Plenary Talks
High Performance Computing and Trends: Connected Computational Requirements with Computing ResourcesFull-text access may be available. Sign in or learn about subscription options.pp. 135
by J. Dongarra
Sorting and selection with structured costsFull-text access may be available. Sign in or learn about subscription options.pp. 416-425
by A. Gupta, A. Kumar
Plenary Talks
Future Directions for the Scyld Advanced Beowulf Management SystemFull-text access may be available. Sign in or learn about subscription options.pp. 136
by D. Becker
Online facility locationFull-text access may be available. Sign in or learn about subscription options.pp. 426-431
by A. Meyerson
Plenary Talks
OSCAR and the Beowulf Arms Race for the "Cluster Standard"Full-text access may be available. Sign in or learn about subscription options.pp. 137
by S.L. Scott
Testing subgraphs in large graphsFull-text access may be available. Sign in or learn about subscription options.pp. 434-441
by N. Alon
Posters
CPPvm - Parallel Programming in C++Full-text access may be available. Sign in or learn about subscription options.pp. 141
by Steffen Görzig
Testing random variables for independence and identityFull-text access may be available. Sign in or learn about subscription options.pp. 442-451
by T. Batu, E. Fischer, L. Fortnow, R. Kumar, R. Rubinfeld, P. White
Posters
Dynamic Cluster Configuration and Management using JavaSpacesFull-text access may be available. Sign in or learn about subscription options.pp. 145
by K.A. Hawick, H.A. James
Fast Monte-Carlo algorithms for approximate matrix multiplicationFull-text access may be available. Sign in or learn about subscription options.pp. 452-459
by P. Drineas, R. Kannan
Posters
Communication with Threads in Software DSMsFull-text access may be available. Sign in or learn about subscription options.pp. 149
by Weiwu Hu Gang Shi, Fuxin Zhang
Posters
IEEE 1394 and RFC 2734; a viable HSI for hypercubesFull-text access may be available. Sign in or learn about subscription options.pp. 155
by Kurt L. Keville, Robert Tompkin
Three theorems regarding testing graph propertiesFull-text access may be available. Sign in or learn about subscription options.pp. 460-469
by O. Goldreich, L. Trevisan
Posters
Hierarchical Cluster for Scalable Web ServersFull-text access may be available. Sign in or learn about subscription options.pp. 156
by J. Hong, D. Kim
Designing networks for selfish users is hardFull-text access may be available. Sign in or learn about subscription options.pp. 472-481
by T. Roughgarden
Posters
A Low-Cost, High-Density Mounting System for Computer ClustersFull-text access may be available. Sign in or learn about subscription options.pp. 157
by John F. Kolen, Tim Hutcheson
Truthful mechanisms for one-parameter agentsFull-text access may be available. Sign in or learn about subscription options.pp. 482-491
by A. Archer, E. Tardos
Building low-diameter P2P networksFull-text access may be available. Sign in or learn about subscription options.pp. 492-499
by G. Pandurangan, P. Raghavan, E. Upfal
Posters
Table-Comparison Prefetching in VIA-based Parallel File SystemFull-text access may be available. Sign in or learn about subscription options.pp. 163
by Yoon-Young Lee, Dae-Wha Seo, Chei-Yol Kim
Web search via hub synthesisFull-text access may be available. Sign in or learn about subscription options.pp. 500-509
by D. Achlioptas, A. Fiat, A.R. Karlin, F. McSherry
Posters
Cluster Trend: DataSpeakingFull-text access may be available. Sign in or learn about subscription options.pp. 168
by PengLiuZhihui Du
Random evolution in massive graphsFull-text access may be available. Sign in or learn about subscription options.pp. 510-519
by W. Aiello, Fan Chung, Linyuan Lu
Posters
Performance Evaluation of Parallel File Systems for PC Clusters and ASCI RedFull-text access may be available. Sign in or learn about subscription options.pp. 172
by Sharad Garg, Jens Mache
Posters
A High-Availability Clustering Architecture with Data Integrity GuaranteesFull-text access may be available. Sign in or learn about subscription options.pp. 178
by Richard Rabbat, Tom McNeal, Tim Burke
Tight approximation results for general covering integer programsFull-text access may be available. Sign in or learn about subscription options.pp. 522-528
by S.G. Kolliopoulos, N.E. Young
Spectral partitioning of random graphsFull-text access may be available. Sign in or learn about subscription options.pp. 529-537
by F. McSherry
Posters
PVM Support for ClustersFull-text access may be available. Sign in or learn about subscription options.pp. 183
by Paul L. Springer
Sequential and parallel algorithms for mixed packing and coveringFull-text access may be available. Sign in or learn about subscription options.pp. 538-546
by N.E. Young
Posters
A Distributed Object Model for Solving Irregularly Structured Problems on ClusterFull-text access may be available. Sign in or learn about subscription options.pp. 187
by Yudong Sun, Cho-Li Wang
Unique sink orientations of cubesFull-text access may be available. Sign in or learn about subscription options.pp. 547-555
by T. Szabo, E. Welzl
Keynote
Towards High-Level Programming Support for Scientific Computing on ClustersFull-text access may be available. Sign in or learn about subscription options.pp. 193
by H.P. Zima
Networking II
Performance and Analysis of the PCI-DDC Remote-Write ImplementationFull-text access may be available. Sign in or learn about subscription options.pp. 197
by Éric Renault, Pierre David
Arc-disjoint paths in expander digraphsFull-text access may be available. Sign in or learn about subscription options.pp. 558-567
by T. Bohman, A. Frieze
Networking II
GMSOCKS - A Direct Sockets Implementation on MyrinetFull-text access may be available. Sign in or learn about subscription options.pp. 204
by Markus Fischer
Glauber dynamics on trees and hyperbolic graphsFull-text access may be available. Sign in or learn about subscription options.pp. 568-578
by C. Kenyon, E. Mossel, Y. Peres
Networking II
A Reconfigurable Extension to the Network Interface of Beowulf ClustersFull-text access may be available. Sign in or learn about subscription options.pp. 212
by Keith D. Underwood, Ron R. Sass, Walter B. Ligon
Showing 100 out of 147
Load More
Load All