26 ;;Quote: Amoeba consists of workstations, pool processors for dynamic allocation, specialized servers, and wide-area network gateways

26+;;Quote: using wide-area network gateways, Amoeba forms a single, uniform system across possibly different countries

26 ;;Quote: Amoeba is an object-oriented distributed operating system

26+;;Quote: Amoeba objects are abstract data types managed by server processes

26+;;Quote: Amoeba servers accessed by remote procedure call (called "transactions")

26 ;;Quote: all Amoeba objects are named and cryptographically protected by capabilities; e.g., access a file by a capability

27 ;;Quote: Amoeba messages consist of a 32 byte header and up to a 30K byte buffer; will be 64 bytes and 1 gigabyte respectively

27+;;Quote: Amoeba request headers with capability for object, operation code, 8 bytes for parameters

27+;;Quote: Amoeba reply headers with error code, 8 bytes of result, and a returned capability

26 ;;Quote: Amoeba remote procedure calls are executed at-most-once; returns success, not executed, or unknown (lost contact, caller must recover)

27 ;;Quote: Amoeba implements remote procedure calls on each processor and in UNIX; allows transparent use of Amoeba

27+;;Quote: small transactions (remote procedure calls) need a short delay while large ones need a high bandwidth

28 ;;Quote: the first DO-TRANSACTION broadcasts the server's port to find its physical network address; used for future transactions (a hint)

28+;;Quote: Amoeba uses server ports (48 bits) to identify a server independently of its network address

28 ;;Quote: the reply message for an Amoeba transaction also acknowledges the request; if delayed, the request is retransmitted and acknowledged

28 ;;Quote: efficient implementation of remote procedure calls by fast code, sweep algorithm for time-outs, and fast context switching

28+;;Quote: Amoeba uses a sweep algorithm to implement time-outs for its communication protocols; periodically checks for progress

30 ;;Quote: Amoeba's RPC delay is 10 times faster than UNIX for short messages and 3 times higher bandwidth for large ones; none better

30 ;;Quote: Amoeba's bullet server stores files contiguously, both on the disk and in the server's main memory; for rapid access

31 ;;Quote: Amoeba's bullet server stores immutable files with read, create, and delete operations; transferred as a unit

31+;;Quote: Amoeba's bullet server deletes old versions when not in the file directory of name, capability pairs; garbage collection

31 ;;Quote: Amoeba files are replicated on two disks; the create-file operation can return when 0, 1 or 2 copies written to disk

31 ;;Quote: a file's capability includes its i-node index; Amoeba's memory-resident i- node table gives the disk and cache address; at most 1 disk seek

31 ;;Quote: Amoeba's create-file operation generates a capability; generating and encrypting the random number is costly (120 msec)

31 ;;Quote: Amoeba's bullet file server reads 2-3 times faster than SUN NFS; large write bandwidth is 4 times higher; small file create is slower