This report presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is designed to minimize the number of messages and also the delay in entering the critical section, at low as well as high loads. The report presents simulation results for the proposed algorit...

Process coordination problems have been extensively addressed in the context of sequential consistency. However, modern shared-memory systems present a large variety of ordering constraints on memory accesses that are much weaker than sequential consistency. We re-addressed two fundamental process coordination problems in the context of weak memory models. We proved that many models cannot supp...

An atom is a system formed by a pack of electrically charged particles Q called nucleus and N identical particles of charge q − . Molecules are systems with several nuclei which may not necessarily be identical . In almost all matter, the nuclei are conglomerates of neutrons and protons and the N remaining particles are electrons. Other atomic systems will be described in the exotic atoms section.

This on-line Appendix complements “Persuading Voters” by Ricardo Alonso and Odilon Câmara (PV henceforth). It provides additional results and discusses extensions of the model. Section B.1 describes the general model. Section B.2 presents additional results. Section B.3 presents extensions of the model. Section B.4 discusses relevant applications and examples. Section B.5 describes an alternati...

Study Tips Hints to help you review more effectively. Answer Sheets Write the letter of the correct answer for the questions in the review tests. Although only one set of answer sheets are included, you can take these tests as often as you want. Review Session A 100-multiple-choice question Review Session to help you determine where you need more study emphasis. However, be aware that none of t...

We investigate the basic fold operations, often referred to as Huzita’s axioms, which represent the standard seven operations used commonly in computational origami. We reformulate the operations by giving them precise conditions that eliminate the degenerate and incident cases. We prove that the reformulated ones yield a finite number of fold lines. Furthermore, we show how the incident cases ...

We design two mutual exclusion algorithms for wireless networks. Our mutual exclusion algorithms are distributed token based algorithms which exploit the opportunistic message overhearing in wireless networks. One of the algorithms is based on overhearing of token transmission. In the other algorithm, overhearing of both token and request messages is exploited. The design goal is to decrease th...

The central thesis of this article is that memory-based methods provide natural and powerful mechanisms for high-autonomy learning control. This paper takes the form of a survey of the ways in which memory-based methods can and have been applied to control tasks, with an emphasis on tasks in robotics and manufacturing. We explain the various forms that control tasks can take, and how this impac...

Within the traditional telephone system a certain level of quality and security has been established over the years. If we try to use IP Telephony systems as a core part of our future communication infrastructure (e.g. as classical PBX enhancement or replacement) continuous high availability, stable and error-free operation and the protection of the privacy of the spoken word are challenges, th...

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...