In the totally anonymous shared memory model of asynchronous distributed computing, processes have no id's and run identical programs. Moreover, processes have identical interface to the shared memory, and in particular, there are no single-writer registers. This paper assumes that processes do not fail, and the shared memory consists only of read/write registers, which are initialized to some ...

Psychiatric case registers have become important instruments for epidemiological research and for the evaluation of care provided for persons suffering from schizophrenia. Under the condition of a sufficient provision of care, case registers permit relatively reliable estimates of "treated" incidence and prevalence, and enable the investigation of associations between morbidity risks, disease c...

Shor’s factoring algorithm uses two quantum registers. By introducing more registers we show that the measured numbers in these registers which are of the same pre-measurement state, should be equal if the original Shor’s complexity argument is sound. This contradicts the argument that the second register has r possible measured values. There is an anonymous comment which argues that the states...

Reducing processor-memory speed gap is one of the major challenges computer architects face today. Efficient use of CPU registers reduces the number of memory accesses. However, registers do incur extra overhead of Load/Store, register allocation and saving of register context across procedure calls. Caches however do not have any such overheads and cache technology has matured to the extent th...