of magnetic materials with MDGRAPE-2 B. G. Elmegreen R. H. Koch M. E. Schabes T. Crawford T. Ebisuzaki H. Furusawa T. Narumi R. Susukita K. Yasuoka The use of accelerator hardware for micromagnetics simulations is described, along with some initial results. The accelerator calculates the dipole interactions at 400 gigaflops, allowing large simulations to be performed with arbitrary geometries. ...

One of the most challenging issues in wireless sensor networks is extension of the overall network lifetime. Data aggregation is one promising solution because it reduces the amount of network traffic by eliminating redundant data. In order to aggregate data, each sensor node must temporarily store received data, which requires a specific amount of memory. Most sensor nodes use static random ac...

Data deduplication has gained increasing popularity as a space-reduction approach in backup storage systems. One of the main challenges for centralized data deduplication is the scalability of fingerprintindex search. In existing system, deduplication mainly focuses on backup system. In this paper, we propose a system that effectively exploits similarity and locality of data blocks to achieve h...

Optimization is often a question of where one should put one’s money in improving performance. As far as large storage hierarchies go, intuition suggests (and common practice supports) adding as much as is affordable of the fastest technology available. Many cache hierarchy studies have shown that this is often not the optimal approach, and we show that for mass storage hierarchies it always te...

Die-stacked DRAM caches represent an emerging technology that offers a new level of cache between SRAM caches and main memory. As compared to SRAM, DRAM caches offer high capacity and bandwidth but incur high access latency costs. Therefore, DRAM caches face new design considerations that include the placement and granularity of tag storage in either DRAM or SRAM. The associativity of the cache...

Massive graphs arise naturally in a lot of applications, especially in communication networks like the internet. The size of these graphs makes it very hard or even impossible to store set of edges in the main memory. Thus, random access to the edges can't be realized, which makes most o ine algorithms unusable. This essay investigates e cient algorithms that read the edges only in a xed sequen...

Spin Transfer Torque RAM (STT-RAM) is a form of computer data storage which allows data items to read and write faster. Every peripheral circuit have some static power consumption, which is consumed while there is no circuit activity. The main objective of the paper is to reduce the static power consumption in peripheral circuits with the help of STT-RAM technology. Instead of fetching instruct...

A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current methods for constructing suffix trees do not scale for large inputs. As suffix trees are larger than the input sequences and quickly outgrow the main memory, the first attempts at building large suffix trees focused on algo...

The implementation of an interactive Video on Demand service is conventionally expensive because each viewer must be allocated a video stream. On the other hand, video streams can be multicast to a number viewers, reducing the system resources. This paper proposes a scheme, called Random Access PMC (RAPMC) which reduces the requirements for supporting an interactive VOD service. It is shown tha...