Results 11 - 20 of 12,976

A new meshless local Petrov-Galerkin (MLPG) approach in computational mechanics

by Satya N. Atluri, Shengping Shen - Comput. Mech , 1998
"... Abstract: A comparison study of the efficiency and ac-curacy of a variety of meshless trial and test functions is presented in this paper, based on the general concept of the meshless local Petrov-Galerkin (MLPG) method. 5 types of trial functions, and 6 types of test functions are explored. Differe ..."
Abstract - Cited by 312 (54 self) - Add to MetaCart
examples show that all of the MLPG methods possess excellent rates of convergence, for both the unknown variables and their derivatives. An analysis of computational costs shows that the MLPG5 method is less expensive, both in computational costs as well as definitely in human-labor costs, than the FEM

The Zebra striped network file system

by John H. Hartman, John K. Ousterhout - ACM Transactions on Computer Systems , 1995
"... Zebra is a network file system that increases throughput by striping file data across multiple servers. Rather than striping each file separately, Zebra forms all the new data from each client into a single stream, which it then stripes using an approach similar to a log-structured file system. This ..."
Abstract - Cited by 302 (5 self) - Add to MetaCart
. This provides high performance for writes of small files as well as for reads and writes of large files. Zebra also writes parity information in each stripe in the style of RAID disk arrays; this increases storage costs slightly but allows the system to continue operation even while a single storage server

P-Grid: A self-organizing access structure for P2P information systems

by Karl Aberer - In CoopIS , 2001
"... Peer-To-Peer systems are driving a major paradigm shift in the era of genuinely distributed computing. Gnutella is a good example of a Peer-To-Peer success story: a rather simple software enables Internet users to freely exchange files, such as MP3 music files. But it shows up also some of the limit ..."
Abstract - Cited by 304 (49 self) - Add to MetaCart
strictly based on local interactions, provide reliable data access even with unreliable peers, and scale gracefully both in storage and communication cost.

Provable Data Possession at Untrusted Stores

by Giuseppe Ateniese, Randal Burns, Reza Curtmola , Joseph Herring, Lea Kissner, Zachary Peterson, Dawn Song , 2007
"... We introduce a model for provable data possession (PDP) that allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it. The model generates probabilistic proofs of possession by sampling random sets of blocks from the serv ..."
Abstract - Cited by 302 (9 self) - Add to MetaCart
the server, which drastically reduces I/O costs. The client maintains a constant amount of metadata to verify the proof. The challenge/response protocol transmits a small, constant amount of data, which minimizes network communication. Thus, the PDP model for remote data checking supports large data sets

Limiting Privacy Breaches in Privacy Preserving Data Mining

by Alexandre Evfimievski, Johannes Gehrke, Ramakrishnan Srikant - In PODS , 2003
"... There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One approach for this problem is to randomize the values in individual records, and only disclose the randomized values. The mod ..."
Abstract - Cited by 301 (11 self) - Add to MetaCart
of the transaction, resulting in a dramatic drop in communication and storage cost. Finally, we define new information measures that take privacy breaches into account when quantifying the amount of privacy preserved by randomization.

A cost-effective, high-bandwidth storage architecture

by Garth A. Gibson, David F. Naglet, Khalil Amirit, Jeff Butler, Fay W. Chang, Howard Gobioff, Charles Hardint, Erik Riedelf, David Rochberg, Jim Zelenka - In Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS , 1998
"... (NASD) storage architecture, prototype implementations oj NASD drives, array management for our architecture, and three,filesystems built on our prototype. NASD provides scal-able storage bandwidth without the cost of servers used primarily,fijr trut&rring data from peripheral networks (e.g. SCS ..."
Abstract - Cited by 197 (12 self) - Add to MetaCart
(NASD) storage architecture, prototype implementations oj NASD drives, array management for our architecture, and three,filesystems built on our prototype. NASD provides scal-able storage bandwidth without the cost of servers used primarily,fijr trut&rring data from peripheral networks (e

Ceph: A scalable, highperformance distributed system,” in OSDI,

by Sage A Weil , Scott A Brandt , Ethan L Miller , Darrell D E Long , Carlos Maltzahn , 2006
"... Abstract We have developed Ceph, a distributed file system that provides excellent performance, reliability, and scalability. Ceph maximizes the separation between data and metadata management by replacing allocation tables with a pseudo-random data distribution function (CRUSH) designed for hetero ..."
Abstract - Cited by 275 (32 self) - Add to MetaCart
Abstract We have developed Ceph, a distributed file system that provides excellent performance, reliability, and scalability. Ceph maximizes the separation between data and metadata management by replacing allocation tables with a pseudo-random data distribution function (CRUSH) designed

A real-time garbage collector based on the lifetimes of objects

by Henry Lieberman, Carl Hewitt, Danny Hillis - Communications of the ACM , 1983
"... ABSTRACT: In previous heap storage systems, the cost of creating objects and garbage collection is independent of the lifetime of the object. Since objects with short lifetimes account for a large portion of storage use, it is worth optimizing a garbage collector to reclaim storage for these objects ..."
Abstract - Cited by 268 (1 self) - Add to MetaCart
ABSTRACT: In previous heap storage systems, the cost of creating objects and garbage collection is independent of the lifetime of the object. Since objects with short lifetimes account for a large portion of storage use, it is worth optimizing a garbage collector to reclaim storage

Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches

by Moinuddin K. Qureshi, Yale N. Patt - IEEE/ACM INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE , 2006
"... This paper investigates the problem of partitioning a shared cache between multiple concurrently executing applications. The commonly used LRU policy implicitly partitions a shared cache on a demand basis, giving more cache resources to the application that has a high demand and fewer cache resource ..."
Abstract - Cited by 260 (5 self) - Add to MetaCart
is likely to obtain for a given amount of cache resources. The proposed mechanism monitors each application at runtime using a novel, cost-effective, hardware circuit that requires less than 2kB of storage. The information collected by the monitoring circuits is used by a partitioning algorithm to decide

Pors: proofs of retrievability for large files

by Ari Juels, Burton S. Kaliski - In CCS ’07: Proceedings of the 14th ACM conference on Computer and communications security , 2007
"... Abstract. In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient fo ..."
Abstract - Cited by 254 (8 self) - Add to MetaCart
for the user to recover F in its entirety. A POR may be viewed as a kind of cryptographic proof of knowledge (POK), but one specially designed to handle a large file (or bitstring) F. We explore POR protocols here in which the communication costs, number of memory accesses for the prover, and storage
Results 11 - 20 of 12,976