Distributed Algorithms: 10th International Workshop, WDAG '96, Bologna, Italy, October 9 - 11, 1996. Proceedings
÷zalp Babaoglu, Keith Marzullo
Springer Science & Business Media, Sep 25, 1996 - Computers - 379 pages
Microsystem technology (MST) integrates very small (up to a few nanometers) mechanical, electronic, optical, and other components on a substrate to construct functional devices. These devices are used as intelligent sensors, actuators, and controllers for medical, automotive, household and many other purposes. This book is a basic introduction to MST for students, engineers, and scientists. It is the first of its kind to cover MST in its entirety. It gives a comprehensive treatment of all important parts of MST such as microfabrication technologies, microactuators, microsensors, development and testing of microsystems, and information processing in microsystems. It surveys products built to date and experimental products and gives a comprehensive view of all developments leading to MST devices and robots.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
access Wc Actor assume asynchronous atomic commitment broadcasting building block communication concurrent configuration connection consensus contains correct nodes correct process defined definition denoted detection distributed algorithms Distributed Computing distributed garbage distributed systems divided image Euler cycle eventually reliable execution failure detector fault-tolerant FD-oracle FindNode finite function garbage collection holds implementation implies infinite initial input integers interval graph Interval Routing Labeling Scheme Lemma logical clocks mark-red message passing NDCSA Network Objects node number of messages operation optimal output paper partial trace partition path Paxos algorithm phase problem Proc procedure Proceedings processors Proof properties quorum system reachable real-time received reference counting reliable channels reliable links remote clock requires result round routing scheme satisfies sender sequence serializable simplex simulation Simulation Theorem snapshot solves step suspected synchronisation termination Theorem timestamps topology triangle lattice variables vector clocks vertex vertices weak accuracy