This paper proposes a transparent selective sequential consistency approach to Distributed Shared Memory (DSM) systems. First, three basic techniques | time selection, processor selection, and data selection { are analyzed for improving the performance of strictly se- quential consistency DSM systems, and a transpar- ent approach to achieving these selections is proposed. Then, this paper focuses on the protocols and tech- niques devised to achieve transparent data selection, including a novel Selective Lazy/Eager Updates Propa- gation protocol for propagating updates on shared data objects, and the Critical Region Updated Pages Set scheme to automatically detect the associations be- tween shared data objects and synchronization objects. The proposed approach is able to o er the same poten- tial performance advantages as the Entry Consistency model or the Scope Consistency model, but it imposes no extra burden to programmers and never fails to ex- ecute programs correctly. The devised protocols and techniques have been implemented and experimented with in the context of the TreadMarks DSM system. Performance results have shown that for many appli- cations, our transparent data selection approach out- performs the Lazy Release Consistency model using a lazy or eager updates propagation protocol.