NDLI: Toward a decidable notion of sequential consistency

Please wait, while we are loading the content...

Optimal sharing of bags of tasks in heterogeneous clusters

A practical algorithm for constructing oblivious routing schemes

Optimal fault-tolerant linear arrays

I/O-efficient topological sorting of planar DAGs

A proportionate fair scheduling rule with good worst-case performance

Performance comparison of MPI and three openMP programming styles on shared memory multiprocessors

Designing overlay multicast networks for streaming

Compact routing with name independence

Analysis of link reversal routing algorithms for mobile ad hoc networks

High throughput, parallelized 128-bit AES encryption in a resource-limited FPGA

The load rebalancing problem

Polynomial time algorithms for network information flow

Toward a decidable notion of sequential consistency

Information gathering in adversarial systems: lines and cycles

Minimizing total flow time and total completion time with immediate dispatching

A polynomial-time tree decomposition to minimize congestion

The effect of communication costs in solid-state quantum computing architectures

MST construction in O(log log n) communication rounds

Integrated prefetching and caching in single and parallel disk systems

Quantifying instruction criticality for shared memory multiprocessors

Combining online algorithms for rejection and acceptance

Tree based MPLS routing

On local algorithms for topology control and routing in ad hoc networks

MAPO: using a committee of algorithm-experts for parallel optimization of costly functions

Load balancing of unit size tokens and expansion properties of graphs

Improved approximation algorithms for the freeze-tag problem

Nonblocking k-compare-single-swap

A near optimal scheduler for switch-memory-switch routers

Online deadline scheduling: multiple machines and randomization

Online oblivious routing

VLSI layout of trees into grids of minimum width

Asynchronous parallel disk sorting

Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging

Throughput-centric routing algorithm design

Worst case mobility in ad hoc networks

Buffer overflows of merging streams

Cycle stealing under immediate dispatch task assignment

Can we elect if we cannot compare?

Scheduling policies for CIOQ switches

Novel architectures for P2P applications: the continuous-discrete approach

TCP is competitive against a limited adversary

Short length menger's theorem and reliable optical routing

Randomized permutations in a coarse grained parallel environment

Relaxing the problem-size bound for out-of-core columnsort

Bicriteria approximation algorithms for scheduling problems with communications

The complexity of verifying memory coherence

Efficient galois field arithmetic on SIMD architectures

Toward a decidable notion of sequential consistency

Content Provider	ACM Digital Library
Author	Condon, Anne Hu, Alan J. Bingham, Jesse D.
Abstract	A memory model specifies a correctness requirement for a distributed shared memory protocol. Sequential consistency (SC) is the most widely researched model; previous work citealur1996 has shown that, in general, the SC verification problem is undecidable. We identify two aspects of the formulation found in citealur1996 that we consider to be highly unnatural; we call these non-prefix-closedness and prophetic inheritance. We conjecture that preclusion of such behavior yields a decidable version of SC, which we call decisive sequential consistency (DSC). We also introduce a structure called a phview window (VW), which retains information about a protocol's history, and we define the notion of a phVW-bound, which essentially bounds the size of the VWs needed to maintain DSC. We prove that the class of DSC protocols with VW-bound k is decidable; left conjectured is the hypothesis that all DSC protocols have such a bound, and further that the bound is computable from the protocol description. This hypothesis is true for all real protocols known to us; we verify its truth for the Lazy Caching protocol citeafek1993.
Starting Page	304
Ending Page	313
Page Count	10
File Format	PDF
ISBN	1581136617
DOI	10.1145/777412.777467
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2003-06-07
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Sequential consistency Shared memory systems Memory model
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in