This paper presents an access time model for the Tandberg MLR1 serpentine tape drive and provides low-cost algorithms to characterize this model for each individual tape. The access time model is used to study the effects of scheduling of I/O requests. Simulations and experiments show that use of proper scheduling algorithms provides substantial improvement of the random I/O performance.

Many web applications operate on large amount of web data. How to store and access the data itself is becoming a serious problem, especially with the dynamic of the web. This paper introduces an approach that helps applications to manage evolving web data efficiently, saving a lot of storage space with fast access to the data. One important feature of this framework is that the worst case of ra...

SUMMARY This paper reports a 65 nm 8 Mb spin transfer torque mag-netoresistance random access memory (STT-MRAM) operating at a single supply voltage with a process-variation-tolerant sense amplifier. The proposed sense amplifier comprises a boosted-gate nMOS and negative-resistance pMOSs as loads, which maximizes the readout margin at any process corner. The STT-MRAM achieves a cycle time of 1....

Eliciting the preferences of a set of agents over a set of alternatives is a problem of fundamental importance in social choice theory. Prior work on this problem has studied the query complexity of preference elicitation for the unrestricted domain and for the domain of single peaked preferences. In this paper, we consider the domain of single crossing preference profiles and study the query c...

The use of cache memory makes the processing of access in a faster rate. The main purpose of cache memory is to give faster memory access by which the data read should be fast and at the same period d provide less expensive and types of semiconductor memories which are of large memory size. There is correspondingly main memory which is large but slow together with a smaller as well faster cache...

Macros have a long-standing role in planning as a tool for representing repeating subsequences of operators. Macros are useful both for guiding search towards a solution and for representing plans compactly. In this paper we introduce automata plans which consist of hierarchies of finite state automata. Automata plans can be viewed as an extension of macros that enables parametrization and bran...