LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 247-249 of 486

    • The Colored Ticket Algorithm 

      Fischer, Michael J.; Lynch, Nancy A.; Burns, James; Borodin, Allan (1983-08)
      Upper and lower bounds are proved for shared space requirements for solution of a problem involving resource allocation among asynchronous processes. The problem is to allocate some number, k≥1, of resources, in an environment ...

    • Complexity of Network Synchronization 

      Awerbuch, Baruch (1985-01)
      In this paper we investigate the problem of simulation of the synchronous network by the asynchronous one. We propose a new simulation technique, referred to as "Synchronizer" which is a new, simple methodology for desiging ...

    • Proposal for a Small Scheme Implementation 

      Schooler, Richard; Stamos, James W. (1984-10)
      Scheme is a lexically scoped dialect of LISP developed at MIT. In this report we determine the feasibility of implementing a Scheme-based programming/application environment on a contemporary personal computer such as the ...