Aman Singla
- 1.H. Abdel-Shafi, J. C. Hall, S. V. Adve, and V. S. Adve. An Evaluation of Fine-Grain Producer-Initiated Communication in Cache-Coherent Multiprocessors. In Third International Symposium on High Performance Computer Architecture, February 1997.]] Google Scholar
Digital Library
- 2.R. H. Arpaci, A. M. Vahdat, T. Anderson, and D. Patterson. Combining Parallel and Sequential Workloads on a Network of Workstations.]]Google Scholar
- 3.J. B. Carter, J. K. Bennett, and W. Zwaenepoel. Implementation and Performance of Munin. In The 13th ACM Symposium on Operating Systems Principles, October 1991.]] Google ScholarDigital Library
- 4.K.M. Chandy and J. Misra. Distributed simulation: A case study in design and verification of distributed programs. IEEE Transactions on Software Engineering, SE-5(5):440-452, September 1979.]]Google ScholarDigital Library
- 5.E Dahlgren and P. Stenstrom. Using Write Caches to Improve Performance of Cache Coherence Protocols in Shared Memory Multiprocessors. Technical report, Department of Computer Engineering, Lund University, April 1993.]]Google Scholar
- 6.R. M. Fujimoto. Parallel discrete event simulation. Communications of the ACM, 33(10):30-53, October 1990.]] Google ScholarDigital Library
- 7.K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. L. Hennessy. Memory Consistency and Event Ordering in Scalable Shared-Memory Multiprocessors. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 15-26, May 1990.]] Google ScholarDigital Library
- 8.J. R. Goodman. Cache consistency and sequential consistency. Technical Report Technical Report #1006, University of Wisconsin, Madison, February 1991.]]Google Scholar
- 9.J. Hodgins, W. Wooten, D. Brogan, and J. O'Brien. Animating Human Athletics. In ACM SIGGRAPH 95 Computer Graphics Proceedings, pages 71-78, August 1995.]] Google ScholarDigital Library
- 10.D. R. Jefferson. Virtual Time. ACM Transactions on Programming Languages and Systems, 7(3):404-425, July 1985.]] Google ScholarDigital Library
- 11.P. Keleher, S. Dwarkadas, A.L. Cox, and W. Zwaenepoel. TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems. In Proceedings of the Winter 94 Usenix Conference, pages 115-131, January 1994.]] Google ScholarDigital Library
- 12.L. Kontothanassis, G. Hunt, et al. VM-based Shared Memory on Low Latency Remote Memory Access Networks. In Proceedings of the 24th Annual International Symposium on Computer Architecture, 1997.]] Google ScholarDigital Library
- 13.D. A. Koufaty, X. Chen, D. K. Poulsen, and J. Torrellas. Data forwarding in scalable shared memory multiprocessors. In Ninth ACM International Conference on Supercomputing, pages 255-264, July 1995.]] Google ScholarDigital Library
- 14.L. Lamport. How to make a Multiprocessor Computer that Correctly executes Multiprocess Programs. IEEE Transactions on Computer S3'stems, C-28(9), 1979.]]Google Scholar
- 15.D. Lenoski, J. Laudon, T. Joe, D. Nakahira, L. Stevens, A. Gupta, and J. Hennessy. The DASH prototype: Logic overhead and performance. Transactions on parallel and distributed systems, 4( 1 ): 41-61, January 1993.]] Google ScholarDigital Library
- 16.K. Li and P. Hudak. Memory Coherence in Shared Virtual Memory Systems. ACM TOCS, 7(4):321-359, November 1989.]] Google ScholarDigital Library
- 17.E Mattern, M. Cosnard, Y. Robert, P. Quinton, and M. Raynal. Virtual Time and Global States of Distributed Systems. In International Workshop on Parallel and Distributed Algorithms, October 1988.]]Google Scholar
- 18.S. Pakin, M. Lauria, et al. Fast Messages (FM) 2.0 User Documentation.]]Google Scholar
- 19.U. Ramachandran, G. Shah, A. Sivasubramaniam, A. Singla, and I. Yanasak. Architectural Mechanisms for Explicit Communication in Shared Memory Multiprocessors. In Proceedings of Supercomputing '95, December 1995.]] Google ScholarDigital Library
- 20.E. Rosti et al. The KSRI: Experimentation and modeling of poststore. In Proceedings of the ACM SIGMET- RICS 1993 Conference on Measurement and Modeling of Computer Systems, Santa Clara, CA, 1993.]] Google ScholarDigital Library
- 21.D. J. Scales, K. Gharachorloo, and C. A. Thekkath. Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory. In Proceedings of the Seventh International Conference on Architectural Support for Programming Languages and Operating Systems, October 1996.]] Google ScholarDigital Library
- 22.K. Schwan and H. Zhou. Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads. IEEE Transactions on Software Engineering, 18(8):736-748, August 1992.]] Google ScholarDigital Library
- 23.S. K. Singhal. Effective Remote Modeling in Large- Scale Distributed Simulation and Visualization Environments. PhD thesis, Department of Computer Science, Stanford University, August 1996.]] Google ScholarDigital Library
- 24.A. Singla, U. Ramachandran, and J. Hodgins. Temporal notions of Synchronization and Consistency in Beehive. Technical Report GIT-CC-96-27, College of Computing, Georgia Institute of Technology, October 1996.]]Google Scholar
- 25.Z. Xiao, F. Gomes, B. Unger, and J. Cleary. A fast asynchronous GVT algorithm for shared memory multiprocessor architectures. In Ninth Workshop on Parallel and Distributed Simulation, 1995.]] Google ScholarDigital Library
- 26.R. Yavatkar. MCP: a protocol for coordination and temporal synchronization in multimedia collaborative applications. In 12th bTternational Conference on Distributed Computing Systems, June 1992.]]Google Scholar
Index Terms
- Temporal notions of synchronization and consistency in Beehive
Recommendations
Weak consistency notions for all the CSPs of bounded width
LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer ScienceThe characterization of all the Constraint Satisfaction Problems of bounded width, proposed by Feder and Vardi [SICOMP'98], was confirmed in [Bulatov'09] and independently in [FOCS'09, JACM'14]. Both proofs are based on the (2,3)-consistency (using ...
Consistency of Triangulated Temporal Qualitative Constraint Networks
ICTAI '11: Proceedings of the 2011 IEEE 23rd International Conference on Tools with Artificial IntelligenceIn this paper, we introduce for the qualitative constraint networks (QCNs) a new consistency: the partial weak composition consistency. The partial weak composition consistency, similarly to the partial path-consistency, considers triangles of a graph ...
Partition consistency
This paper provides a case study of specifying an abstract memory consistency model, providing possible implementations for the model, and proving the correctness of implementations. Specifically, we introduce a class of memory consistency models called ...
Comments