Learn More
Science from the State University of New York at Stony Brook in 1983 and 1985 respectively. His research interests include distributed operating systems, consistency of shared information in large scale distributed systems, and replicated data systems. Institute of Technology before joining Bellcore in 1993. He is currently a Member of Technical Staff in(More)
Shared memories that provide weaker consistency guarantees than the traditional sequentially consistent or atomic memories have been claimed to provide the key to building scalable systems. One influential memory model, processor considency, has been cited widely in the literature but, due to the lack of a precise and formal definition, contradictory claims(More)
Distributed systems that consist of workstations connected by high performance interconnects ooer computational power comparable to moderate size parallel machines. Middleware like Distributed Shared Memory (DSM) or Distributed Shared Objects (DSO) attempts to improve the programmability of such hardware by presenting to application programmers interfaces(More)
In order to provide acceptable performance in large scale distributed systems, shared data must be cached at or close to nodes where it is accessed. Maintaining the consistency of such cached data is an important problem in distributed systems. We claim that <i>causal memory</i>, which defines consistency of shared data based on causal orderings between(More)
  • Millipede, M Ahamad, R A Bazzi, R John, P Kohli, G Neiger +7 others
  • 2011
1. A use or assign of V is permitted only when dictated by the execution of T. 2. A store of V by T must intervene between an assign of V by T and a subsequent load of V by T. 3. An assign of V by T must intervene between a load or a store of V by T and a subsequent store of V by T. 4. A variable is said to be new when it it used by a thread for the rst(More)
  • 1