{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:11:08Z","timestamp":1648991468667},"reference-count":3,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2008,6]]},"abstract":"<jats:p> An alternator is an arbitrary set of interacting processes that satisfies three conditions. First, if a process executes its critical section, then no neighbor of that process can execute its critical section at the same state. Second, along any infinite sequence of system states, each process will execute its critical section, an infinite number of times. Third, along any maximally concurrent computation, the alternator will stabilize to a sequence of states in which the processes will execute their critical sections in alternation. A principal reason for interest in alternators is their ability to transform systems correct under serial execution semantics to systems that are correct under concurrent execution semantics. An earlier alternator for arbitrary topology required 2q states where q is the dependency graph circumference and after stabilization would wait 2q steps between critical section executions. In a synchronous environment, this alternator requires only 2d+1 states where d is the degree of the graph of process dependencies for the system and after stabilization will require a wait of 2d+1 steps between critical section executions. In an asynchronous environment, the synchronization properties of this alternator must be supplemented with an asynchronous unison algorithm. The asynchronous unison algorithm requires expansion of the required number of states to dt, where t is the longest chordless cycle in the dependency graph; however, the required wait between critical section executions remains O(d). <\/jats:p>","DOI":"10.1142\/s0129626408003405","type":"journal-article","created":{"date-parts":[[2008,5,29]],"date-time":"2008-05-29T11:05:22Z","timestamp":1212059122000},"page":"307-322","source":"Crossref","is-referenced-by-count":0,"title":["AN ORDER DEGREE ALTERNATOR FOR ARBITRARY TOPOLOGIES"],"prefix":"10.1142","volume":"18","author":[{"given":"F. FURMAN","family":"HADDIX","sequence":"first","affiliation":[{"name":"Department of Computer Science, Minnesota State University, 273 Wissink Hall, Mankato, MN 56001, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf7","first-page":"766","volume":"52","author":"Nesterenko Mikhail","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.11.009"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1145\/295656.295659"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626408003405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:30:47Z","timestamp":1565184647000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626408003405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":3,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2008,6]]}},"alternative-id":["10.1142\/S0129626408003405"],"URL":"https:\/\/doi.org\/10.1142\/s0129626408003405","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6]]}}}