🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: cu.cs.ugrads
Article #156

CS Colloquium for Yuanyuan Zhou 4/18/02

#156
From: Stephanie Morris
Date: Mon, 15 Apr 2002 16:00
60 lines
4821 bytes
University of Colorado at Boulder
Department of Computer Science
ECOT 717 Engineering Center
Campus Box 430
Boulder, Colorado 803090430
(303) 4927514, FAX: (303) 4922844

CS COLLOQUIUM
Improving the performance of storage servers
Yuanyuan Zhou
Princeton University
DATE
3:30  4:30 PM
Engineering Center Classroom 265

Refreshments will be served afterwards in ECOT 832

Current technology trends indicate a widening gap between processor speed 
and disk access time. As a result, storage I/O has become a very serious 
bottleneck for many I/O-intensive applications such as databases. In this 
talk, I will present two solutions to improve the storage server 
performance: effective storage server caching; and minimizing I/O-related 
host overheads.
Effective caching is an important method to reduce the latency and improve 
the throughput of I/O operations of a storage server.Although the file 
caching and database caching have been studied extensively during the past 
decades, it is not well understood how to effectively manage the cache 
memory of a storage server in a multi-tier storage infrastructure where 
there are three levels of caches: client cache, file or database cache and 
storage server cache. Our research studied the access patterns to storage 
server caches with several commercial workloads. Based on our analysis of 
access patterns, we derived a multi-queue algorithm for storage server 
caching. Our experimental results with simulation and implementation show 
that this algorithm is quite effective. Forseveral OLTP database 
workloads,this method can achieve the same hit ratios as the commonly-used 
LRU algorithm with a twice large storage cache.
Minimizing I/O-related host overheads is a key to improve the performance 
of a network attached storage server. Recent studies have shown that 
storage I/Os have very high overheads on database servers, especially for 
OLTP workloads. To alleviate these overheads, we have studied the effects 
and design issues of using user-level communication to connecta 
databasesystem with a storage server. Our results with OLTP workloads show 
that substantial enhancements are required to effectively use user level 
communication as a storage area network.We have developed a direct storage 
access API to fully exploit the benefits of user level communication. This 
method can reduce the I/O related overheads by 40% and improve the database 
transaction rate by 18% for OLTP workloads.
Host:  Dirk Grunwald
------------------------------
http://www.cs.colorado.edu/department/events/colloquia/colloquia.html

Sign Language Interpreters Available Upon Request.  Please contact Jane 
Obrecht, Department of
Computer Science, Engineering  ECOT 722, 303-492-6101, at least five days 
prior to the colloquium.

_______________________________________________
cscolloq mailing list
cscolloq@cs.colorado.edu
http://www.cs.colorado.edu/mailman/listinfo/cscolloq
Technical Details
Message-ID: <1018989323.12134@csnews.cs.colorado.edu>
Path: arc1-ca.pugleaf.net!archiver1.google.com!news1.google.com!sn-xit-02!sn-xit-06!supernews.com!news-out.visi.com!hermes.visi.com!nycmny1-snh1.gtei.net!denver-snf1.gtei.net!news.gtei.net!coop.net!cs.colorado.edu!csnews!recnews

Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 11534c,ea35fa42fe1af65a,start
X-Google-Attributes: gid11534c,public
X-Google-ArrivalTime: 2002-04-16 13:35:25 PST
Newsgroups: cu.cs.ugrads
X-Sender: scmorris@columbine.cs.colorado.edu
X-Mailer: QUALCOMM Windows Eudora Pro Version 4.2.2 
From: Stephanie Morris <Stephanie.Morris@colorado.edu>
Subject: CS Colloquium for Yuanyuan Zhou 4/18/02
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"; format=flowed
Errors-To: cscolloq-admin@cs.colorado.edu
X-BeenThere: cscolloq@cs.colorado.edu
X-Mailman-Version: 2.0.5
Precedence: bulk
Reply-To: scmorris@columbine.cs.colorado.edu
List-Help: <mailto:cscolloq-request@cs.colorado.edu?subject=help>
List-Post: <mailto:cscolloq@cs.colorado.edu>
List-Subscribe: <http://www.cs.colorado.edu/mailman/listinfo/cscolloq>,
 <mailto:cscolloq-request@cs.colorado.edu?subject=subscribe>
List-Id: CS Colloquium announcements <cscolloq.cs.colorado.edu>
List-Unsubscribe: <http://www.cs.colorado.edu/mailman/listinfo/cscolloq>,
 <mailto:cscolloq-request@cs.colorado.edu?subject=unsubscribe>
List-Archive: <http://www.cs.colorado.edu/pipermail/cscolloq/>
Date: 15 Apr 2002 10:00:43 -0600
Message-ID: <1018989323.12134@csnews.cs.colorado.edu>
Sender: news
Distribution: co
X-Note1: message-id generated by recnews
X-Note2: mail msgid was   <4.2.2.20020415095759.0260fc98@columbine.cs.colorado.edu>
Originator: daemon@csnews.cs.colorado.edu
NNTP-Posting-Host: csnews.cs.colorado.edu
X-Trace: cs.colorado.edu!csnews 1018989323 csnews.cs.colorado.edu (16 Apr 2002 14:35:23 -0600)
Lines: 60
Path: arc1-ca.pugleaf.net!archiver1.google.com!news1.google.com!sn-xit-02!sn-xit-06!supernews.com!news-out.visi.com!hermes.visi.com!nycmny1-snh1.gtei.net!denver-snf1.gtei.net!news.gtei.net!coop.net!cs.colorado.edu!csnews!recnews