Sciweavers

1732 search results - page 331 / 347
» New Challenges in Parallel Optimization
Sort
View
ICALP
1992
Springer
13 years 12 months ago
Near-perfect Token Distribution
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli ...
WWW
2004
ACM
14 years 8 months ago
C3W: clipping, connecting and cloning for the web
Many of today's Web applications support just simple trial-anderror retrievals: supply one set of parameters, obtain one set of results. For a user who wants to examine a num...
Aran Lunzer, Jun Fujima, Kasper Hornbæk, Yuz...
ICS
2009
Tsinghua U.
14 years 2 months ago
/scratch as a cache: rethinking HPC center scratch storage
To sustain emerging data-intensive scientific applications, High Performance Computing (HPC) centers invest a notable fraction of their operating budget on a specialized fast sto...
Henry M. Monti, Ali Raza Butt, Sudharshan S. Vazhk...
CCGRID
2003
IEEE
14 years 1 months ago
Performability Evaluation of Networked Storage Systems Using N-SPEK
This paper introduces a new benchmark tool for evaluating performance and availability (performability) of networked storage systems, specifically storage area network (SAN) that...
Ming Zhang, Qing Yang, Xubin He
ASPLOS
2006
ACM
13 years 11 months ago
Comprehensively and efficiently protecting the heap
The goal of this paper is to propose a scheme that provides comprehensive security protection for the heap. Heap vulnerabilities are increasingly being exploited for attacks on co...
Mazen Kharbutli, Xiaowei Jiang, Yan Solihin, Guru ...