NASA Scientific and Technical Aerospace Reports

Storage Resource Manager protocol, SRM, which is evolving to an open standard for grid middleware to communicate with
site specific storage fabrics.
Author
Computer Programs; Data Storage; Systems Engineering
20040121046 Arizona State Univ., AZ, USA
Quanta Data Storage: A New Storage Paradigm
Gurumohan, Prabhanjan C.; Narasimhamurthy, Sai S. B.; Hui, Joseph Y.; NASA/IEEE MSST 2004 Twelfth NASA Goddard
Conference on Mass Storage Systems and Technologies in cooperation with the Twenty-First IEEE Conference on Mass
Storage Systems and Technologies; April 2004, pp. 215-221; In English; See also 20040121020; No Copyright; Avail: CASI;
A02, Hardcopy
TCP layer and poor iSCSI implementations have been identified as the main bottlenecks in realizing high iSCSI
performance. With the addition of security mechanisms the throughput achieved by the storage system using iSCSI is further
reduced. Along with the above mentioned problems, we argue that the excessive processing redundancy introduced by several
protocol layers and use of protocols designed for non-storage specific requirements result in poor storage network
architectures. In order to overcome these issues, we introduce a new storage paradigm in which data is manipulated, encrypted
and stored in fixed block sizes called quanta. Each quanta is manipulated by a single effective cross layer (ECL) that includes
security features, iSCSI functionalities, direct data placement techniques and data transport mechanisms. Further, the new
architecture emphasizes majority of burden of computation for achieving security on the clients. Qualitative description of the
idea is presented. Performance improvements observed during tests of the idea are presented. Through emulation and analysis
we also show that the size of the quanta must be equal to the minimum path MTU for maximum throughput.
Author
Data Storage; Internets; Protocol (Computers); Computer Networks
20040121047 New Jersey Inst. of Tech., Newark, NJ, USA
Rebuild Strategies for Redundant Disk Arrays
Fu, Gang; Thomasian, Alexander; Han, Chun-Qi; Ng, Spencer; NASA/IEEE MSST 2004 Twelfth NASA Goddard Conference
on Mass Storage Systems and Technologies in cooperation with the Twenty-First IEEE Conference on Mass Storage Systems
and Technologies; April 2004, pp. 223-225; In English; See also 20040121020
Contract(s)/Grant(s): NSF CSA-01-05485; No Copyright; Avail: CASI; A01, Hardcopy
RAID5 performance is critical while rebuild is in progress, since in addition to the increased load to recreate lost data on
demand, there is interference caused by rebuild requests. We report on simulation results, which show that processing user
requests at a higher, rather than the same priority as rebuild requests, results in a lower response time for user requests, as well
as reduced rebuild time. Several other parameters related to rebuild processing are also explored.
Author
Computer Systems Performance; Redundancy; Architecture (Computers); Computer Storage Devices
20040121048 Pohang Univ. of Science and Technology, Kyungbuk, Korea, Republic of
Regulating I/O Performance of Shared Storage with a Control Theoretical Approach
Lee, Han Deok; Nam, Young Jin; Jung, Kyong Jo; Jung, Seok Gan; Park, Channik; NASA/IEEE MSST 2004 Twelfth NASA
Goddard Conference on Mass Storage Systems and Technologies in cooperation with the Twenty-First IEEE Conference on
Mass Storage Systems and Technologies; April 2004, pp. 105-117; In English; See also 20040121020
Contract(s)/Grant(s): KSEF-R01-2003-000-10739-0; No Copyright; Avail: CASI; A03, Hardcopy
Shared storage has become commonplace with recent trends in storage technologies, such as storage consolidation and
virtualization, etc. Meanwhile, storage QoS, which guarantees different storage service requirements from various applications
toward shared storage, is gaining in importance. This paper proposes a new scheme which combines a feedback-controlled
leaky bucket with a fair queuing algorithm in order to deliver guaranteed storage service for applications competing for shared
storage. It not only assures an agreed-upon response time for each application, but also maximizes the aggregate I/O
throughput by proportionating unused bandwidth to other active applications. Simulation results under various types of
competing I/O workloads validate the features of the proposed scheme.
Author
Numerical Analysis; Simulation; Feedback; Algorithms; Computer Storage Devices
256