Results 81 to 90 of about 1,131,561 (127)
The FORCE: A highly portable parallel programming language [PDF]
Here, it is explained why the FORCE parallel programming language is easily portable among six different shared-memory microprocessors, and how a two-level macro preprocessor makes it possible to hide low level machine dependencies and to build machine ...
Alaghband, Gita +3 more
core +1 more source
, 2017 This article examines the hypothesis that shared memory represents an archetypal form of commons, because it can be understood both as a condition and a result of any commons process. By distinguishing it from the "collective memory" theorized by Halbwachs (which results from the unification of individual memories through the external action of social ...
openaire +1 more source
Cells, shared memory and breaking the PTM code
Molecular Systems Biology, 2012 Pau Creixell, Rune Linding
doaj +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of the ACM, 2022
Assuming that there is an a priori agreement between processes on the names of shared memory locations, as is done in almost all the publications on concurrent shared memory algorithms, is tantamount to assuming that agreement has already been solved at a lower level.
openaire +1 more source
Assuming that there is an a priori agreement between processes on the names of shared memory locations, as is done in almost all the publications on concurrent shared memory algorithms, is tantamount to assuming that agreement has already been solved at a lower level.
openaire +1 more source
IEEE Transactions on Communications, 1983
Efficient design of service facilities, such as data or computer networks that meet random demands, often leads to the sharing of resources among users. Contention for the use of a resource results in queueing. The waiting room is a part of any such service facility. The number of accepted service requests per unit of time (throughput), or the fraction
Foschini, Gerard J., Gopinath, B.
openaire +1 more source
Efficient design of service facilities, such as data or computer networks that meet random demands, often leads to the sharing of resources among users. Contention for the use of a resource results in queueing. The waiting room is a part of any such service facility. The number of accepted service requests per unit of time (throughput), or the fraction
Foschini, Gerard J., Gopinath, B.
openaire +1 more source
SIAM Journal on Computing, 1997
Summary: Sequential consistency is the most widely used correctness condition for multiprocessor memory systems. This paper studies the problem of testing shared- memory multiprocessors to determine if they are indeed providing a sequentially consistent memory.
Gibbons, Phillip B., Korach, Ephraim
openaire +1 more source
Summary: Sequential consistency is the most widely used correctness condition for multiprocessor memory systems. This paper studies the problem of testing shared- memory multiprocessors to determine if they are indeed providing a sequentially consistent memory.
Gibbons, Phillip B., Korach, Ephraim
openaire +1 more source