نتایج جستجو برای: x86 registers values

تعداد نتایج: 528056  

Journal: :Distributed Computing 1994

Journal: :Scandinavian Economic History Review 1970

2007
Colette Johnen

We present in this paper a deterministic silence and self stabilizing leader election algorithm on unidirectional id based rings which have a bound on their id values The id values of proces sors in a ring whose size is N have to be inferior to N k The size of communication registers required by the algorithm is constant The algorithm stabilizes in k N time keywords self stabilization leader el...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه یزد - دانشکده علوم اجتماعی 1392

this study aims to investigate value conflicts between mothers and their daughters among families and influential factors on this conflict in yazd city. this study adopted a survey method and a questionnaire was used that its validity through construct validity (factor analysis) and its reliability by cronbach alpha were measured. the population of this study consists of all yazdian families th...

Journal: :J. Parallel Distrib. Comput. 2009
Damien Imbs Michel Raynal

An atomic snapshot object is an object that can be concurrently accessed by asynchronous processes prone to crash. It is made of m components (base atomic registers) and is defined by two operations: an update operation that allows a process to atomically assign a new value to a component and a snapshot operation that atomically reads and returns the values of all the components. To cope with t...

2002
Mikael Pettersson Konstantinos Sagonas Erik Johansson

Erlang is a concurrent functional language, tailored for large-scale distributed and fault-tolerant control software. Its primary implementation is Ericsson’s Erlang/OTP system, which is based on a virtual machine interpreter. HiPE (High-Performance Erlang) adds a native code execution mode to the Erlang/OTP system. This paper describes the x86 version of HiPE, including a detailed account of d...

2011
Viktor Vafeiadis Francesco Zappa Nardelli

We consider simple compiler optimisations for removing redundant memory fences in programs running on top of the x86-TSO relaxed memory model. While the optimisations are performed using standard thread-local control flow analyses, their correctness is subtle and relies on a non-standard global simulation argument. The implementation and the proof of correctness are programmed in Coq as part of...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید