[Date Prev][Date Next][Thread Prev][Thread Next][Author Index][Date Index][Thread Index]

[merkle.pa@xxxxxxxxx: LEASES: AN EFFICIENT FAULT-TOLERANT MECHANISM]



I'm going to skip it, but it looks like interesting stuff we should
revisit when we start doing real bebe

Return-Path: <merkle.pa@xxxxxxxxx>
From: merkle.pa@xxxxxxxxx
Date: 27 Nov 89 14:07:43 PST
Subject: LEASES:  AN EFFICIENT FAULT-TOLERANT MECHANISM
To: sun!xanadu!mark



	23-Nov-89	Ira Greenberg <ira@xxxxxxxxxxxxx	ITSC Seminar, Cary G. Gray,
Nov. 28, 1989
Return-Path: <@Score.Stanford.EDU:ira@xxxxxxxxxxxxx>
Redistributed: colloquiums.PA
Received: from Score.Stanford.EDU ([36.8.0.46]) by Xerox.COM ; 23 NOV 89
23:47:36 PST
Received: from pong6.itstd.sri.com by SCORE.STANFORD.EDU with TCP; Thu 23
Nov 89 23:34:50-PST
Received: by pong6.itstd.sri.com (5.61/1.3davy)
	id AA05192; Thu, 23 Nov 89 23:31:31 -0800
Message-Id: <8911240731.AA05192@xxxxxxxxxxxxxxxxxxx>
Date: Thu, 23 Nov 89 23:31:31 -0800
From: Ira Greenberg <ira@xxxxxxxxxxxxx>
To: aic-staff@xxxxxxx, ba-seminars@xxxxxxxxxxx, colloq@xxxxxxxxxxxxxxxxxx,
cslstaff@xxxxxxxxxxx, davis@xxxxxxxxxxxxxxxxxx, hirani@xxxxxxx,
istc-menlo@xxxxxxxxxxxxxxxxxx, jcw@xxxxxxxxxxxxxx, jdan@xxxxxxx,
nielson@xxxxxxxxxxxxxxxxxx
Subject: ITSC Seminar, Cary G. Gray, Nov. 28, 1989


Information and Telecommunications Sciences Center Seminar
                              
               LEASES:  AN EFFICIENT FAULT-TOLERANT MECHANISM
                   FOR DISTRIBUTED FILE CACHE CONSISTENCY

                               Cary G. Gray
                        Computer Science Department
                            Stanford University

		      4:00  Tuesday  November 28, 1989
		 	     SRI INTERNATIONAL
		       Conference Room B, Building A


                                 ABSTRACT

Caching  introduces  the overhead and complexity of ensuring consistency, 
reducing some of its  performance  benefits.  In  a  distributed  system, 
caching  must deal with the additional complications of communication and 
host failures.

Leases  are  proposed  as  a time-based mechanism that provides efficient 
consistent access to cached data in  distributed  systems.  Non-Byzantine
failures affect performance, not correctness, with their effect minimized 
by short leases.  An analytic model and an evaluation for file access  in 
the V system show that leases of short duration provide good performance.  
The impact of leases on performance grows more significant in systems  of 
larger scale and higher processor performance.

This work was performed jointly with David Cheriton, Stanford University.

Host: Ira Greenberg (415) 859-4941

NOTE FOR VISITORS TO SRI:

Please  arrive at least 10 minutes early in order to sign in and be
shown to the conference room.

SRI  is  located  at 333 Ravenswood Avenue in Menlo Park.  Visitors
may park in the visitors lot in front  of  Building  A  (red  brick
building  at  333  Ravenswood Avenue, second driveway on the right,
east of Laurel) or in the conference parking  area  at  the  corner
of  Ravenswood and Middlefield.  The seminar room is in Building A.
Visitors should sign in at the reception desk  in  the  Building  A
lobby.                      
 
 
IMPORTANT:  Attendance is open, but visitors from certain countries
designated by the US government must make arrangements in  advance.
If you have not already made such arrangements before your arrival,
admission to the seminar will be denied. If you believe you may  be
from one of these countries and if you wish to make arrangements to
attend, please call Adam Barnett at (415) 859-3367.