Map
Index
Random
Help
th

QuoteRef: fridM5_1985

topics > all references > ThesaHelp: references e-f



ThesaHelp:
references e-f
Topic:
name server or name directory
Topic:
updating information with locking
Topic:
database transactions
Topic:
random number generation
Topic:
security by capabilities
Topic:
encryption
Topic:
client-server model for distributed systems
Topic:
security by access rights
Topic:
virtual memory
Topic:
asynchronous processing
Topic:
disk allocation
Topic:
examples of distributed systems and applications

Reference

Fridrich, M., Older, W., "Helix: The architecture of the XMS distributed file system", IEEE Software, 2, 3, pp. 21-29, May 1985, B describes a cleanly designed distributed file system.. Google

Quotations
21 ;;Quote: Helix provide services by registering taskid and descriptive text string with name server; clients can then use LOCATE service primitive
24 ;;Quote: a commit (snapshot) in Helix colors all blocks red; must write them to new addresses
26 ;;Quote: a Helix server provides 96-bit capabilities which encrypt access rights to an object with 40 bits padding
26 ;;Quote: when a Helix server receives an invalid capability, it should report and log the problem
26 ;;Quote: Helix capabilities will not be regenerated in about twenty years
26 ;;Quote: a Helix client collects a set of capabilities needed for a user session
26 ;;Quote: in Helix, clients can only access objects which they create or were given capabilities for
27 ;;Quote: Helix uses two-phase commit and file sets to implement transactions (large-scale atomic actions)
27+ ;;Quote: access lists are stored with an object; difficult to add users since may require modification of many lists
27 ;;Quote: capabilities are stored in user directories; difficult to revoke access rights
27+ ;;Quote: Helix access mode consists of type (read, write) and a lock (copy, original, exclusive);
27 ;;Quote: a Helix object can have one committable instance, i.e., write-original or write-exclusive access mode; other modes allow sharing and concurrency
28+ ;;Quote: if a Helix application program fails, all resources in its file set are released
28 ;;Quote: if a Helix application program succeeds, its file set is committed
28 ;;Quote: Helix allocates disk blocks sequentially from a bit map; write-with-move ensures clustered writes
29 ;;Quote: Helix supported almost 1000 workstations, 50 file servers, and 15 LANs in 1984
29 ;;Quote: commitment works well in Helix; no shut-down command is provided; take down file servers by pressing reset or turning off


Related Topics up

ThesaHelp: references e-f (168 items)
Topic: name server or name directory (40 items)
Topic: updating information with locking (20 items)
Topic: database transactions (26 items)
Topic: random number generation (29 items)
Topic: security by capabilities (65 items)
Topic: encryption (43 items)
Topic: client-server model for distributed systems (25 items)
Topic: security by access rights (36 items)
Topic: virtual memory (32 items)
Topic: asynchronous processing (30 items)
Topic: disk allocation (32 items)
Topic: examples of distributed systems and applications (24 items)

Collected barberCB 6/87
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.