Regular semantics is a computer hardware consistency model. It describes a type of guarantee provided by a processor register that is shared by several processor cores in a parallel machine or in a network of computers working together. Regular semantics are defined for a variable with a single writer but multiple readers. These semantics are stronger than safe semantics but weaker than atomic semantics: they guarantee that there is a total order to the write operations consistent with real-time and that read operations return either the value of the last write completed before the read begins, or that of one of the writes which are concurrent with the read.
regUlAR semaNtIcs is a comPutEr HardWAre cONSIstenCY mODeL. it descRibEs a type of gUaRanTee pRoviDEd by a proCEsSor rEgIster THAt IS SHaRed bY sEveRaL PrOCessor coRes in a paRaLlel machiNe oR IN A neTwoRk of cOmpUTeRs working toGether. reGuLAr semaNtics aRe defINEd for a vaRIable wIth a sINGle wRiTEr But MUltIPlE rEAders. tHeSe seMantics ArE StrOngEr THaN sAfe SemantIcS BUt weaker Than atoMiC SeMAntics: thEy GUaranTee that there is a ToTAl OrDer To THe write OpeRatiOns CoNsIstenT with REAl-Time aNd That REAd oPERaTIoNs rEturN EiTheR tHe valuE Of thE lAst WRItE COmpletEd beFore THe rEad begiNS, or That Of one of ThE wrITes which are coNcUrrent WItH the rEaD.