The Experts below are selected from a list of 34251 Experts worldwide ranked by ideXlab platform
Michel Raynal - One of the best experts on this subject based on the ideXlab platform.
-
Time-efficient read/write register in crash-prone asynchronous message-passing systems
Computing, 2018Co-Authors: Achour Mostefaoui, Michel Raynal, Matthieu RoyAbstract:The atomic register is one of the most basic and useful object of computing science, and its simple read–write semantics is appealing when programming distributed systems. Hence, its implementation on top of crash-prone asynchronous message-passing systems has received a lot of attention. It was shown that having a strict minority of processes that may crash is a necessary and Sufficient Requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. This paper visits the notion of a fast implementation of an atomic register, and presents a new time-efficient asynchronous algorithm that reduces latency in many cases: a write operation always costs a round-trip delay, while a read operation costs a round-trip delay in favorable circumstances (intuitively, when it is not concurrent with a write). When designing this algorithm, the design spirit was to be as close as possible to the original algorithm proposed by Attiya, Bar-Noy, and Dolev.
-
NETYS - Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems
Networked Systems, 2016Co-Authors: Achour Mostefaoui, Michel RaynalAbstract:The atomic register is certainly the most basic object of computing science. Its implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t < n/2 (where t is the maximal number of processes that may crash) is a necessary and Sufficient Requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper visits the notion of a fast implementation of an atomic register, and presents a new time-efficient asynchronous algorithm. Its time-efficiency is measured according to two different underlying synchrony assumptions. Whatever this assumption, a write operation always costs a round-trip delay, while a read operation costs always a round-trip delay in favorable circumstances (intuitively, when it is not concurrent with a write). When designing this algorithm, the design spirit was to be as close as possible to the one of the famous ABD algorithm (proposed by Attiya, Bar-Noy, and Dolev).
-
Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems
2016Co-Authors: Achour Mostefaoui, Michel RaynalAbstract:Atomic registers are certainly the most basic objects of computing science. Their implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t < n/2 (where t is the maximal number of processes that may crash) is a necessary and Sufficient Requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper presents an algorithm which implements a single-writer multi-reader atomic register with four message types only, and where no message needs to carry control information in addition to its type. Hence, two bits are Sufficient to capture all the control information carried by all the implementation messages. Moreover, the messages of two types need to carry a data value while the messages of the two other types carry no value at all. As far as we know, this algorithm is the first with such an optimality property on the size of control information carried by messages. It is also particularly efficient from a time complexity point of view.
-
Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems
arXiv: Distributed Parallel and Cluster Computing, 2016Co-Authors: Achour Mostefaoui, Michel RaynalAbstract:The atomic register is certainly the most basic object of computing science. Its implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t \textless{} n/2 (where t is the maximal number of processes that may crash) is a necessary and Sufficient Requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper visits the notion of a fast implementation of an atomic register, and presents a new time-efficient asynchronous algorithm. Its time-efficiency is measured according to two different underlying synchrony assumptions. Whatever this assumption, a write operation always costs a round-trip delay, while a read operation costs always a round-trip delay in favorable circumstances (intuitively, when it is not concurrent with a write). When designing this algorithm, the design spirit was to be as close as possible to the one of the famous ABD algorithm (proposed by Attiya, Bar-Noy, and Dolev).
-
Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems
2016Co-Authors: Achour Mostefaoui, Michel RaynalAbstract:The atomic register is certainly the most basic object of computing science. Its implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t < n/2 (where t is the maximal number of processes that may crash) is a necessary and Sufficient Requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper visits the notion of a fast implementation of an atomic register, and presents a new time-efficient asynchronous algorithm. Its time-efficiency is measured according to two different underlying synchrony assumptions. Whatever this assumption, a write operation always costs a round-trip delay, while a read operation costs always a round-trip delay in favorable circumstances (intuitively, when it is not concurrent with a write). When designing this algorithm, the design spirit was to be as close as possible to the one of the famous ABD algorithm (proposed by Attiya, Bar-Noy, and Dolev).
Achour Mostefaoui - One of the best experts on this subject based on the ideXlab platform.
-
Time-efficient read/write register in crash-prone asynchronous message-passing systems
Computing, 2018Co-Authors: Achour Mostefaoui, Michel Raynal, Matthieu RoyAbstract:The atomic register is one of the most basic and useful object of computing science, and its simple read–write semantics is appealing when programming distributed systems. Hence, its implementation on top of crash-prone asynchronous message-passing systems has received a lot of attention. It was shown that having a strict minority of processes that may crash is a necessary and Sufficient Requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. This paper visits the notion of a fast implementation of an atomic register, and presents a new time-efficient asynchronous algorithm that reduces latency in many cases: a write operation always costs a round-trip delay, while a read operation costs a round-trip delay in favorable circumstances (intuitively, when it is not concurrent with a write). When designing this algorithm, the design spirit was to be as close as possible to the original algorithm proposed by Attiya, Bar-Noy, and Dolev.
-
NETYS - Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems
Networked Systems, 2016Co-Authors: Achour Mostefaoui, Michel RaynalAbstract:The atomic register is certainly the most basic object of computing science. Its implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t < n/2 (where t is the maximal number of processes that may crash) is a necessary and Sufficient Requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper visits the notion of a fast implementation of an atomic register, and presents a new time-efficient asynchronous algorithm. Its time-efficiency is measured according to two different underlying synchrony assumptions. Whatever this assumption, a write operation always costs a round-trip delay, while a read operation costs always a round-trip delay in favorable circumstances (intuitively, when it is not concurrent with a write). When designing this algorithm, the design spirit was to be as close as possible to the one of the famous ABD algorithm (proposed by Attiya, Bar-Noy, and Dolev).
-
Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems
2016Co-Authors: Achour Mostefaoui, Michel RaynalAbstract:Atomic registers are certainly the most basic objects of computing science. Their implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t < n/2 (where t is the maximal number of processes that may crash) is a necessary and Sufficient Requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper presents an algorithm which implements a single-writer multi-reader atomic register with four message types only, and where no message needs to carry control information in addition to its type. Hence, two bits are Sufficient to capture all the control information carried by all the implementation messages. Moreover, the messages of two types need to carry a data value while the messages of the two other types carry no value at all. As far as we know, this algorithm is the first with such an optimality property on the size of control information carried by messages. It is also particularly efficient from a time complexity point of view.
-
Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems
arXiv: Distributed Parallel and Cluster Computing, 2016Co-Authors: Achour Mostefaoui, Michel RaynalAbstract:The atomic register is certainly the most basic object of computing science. Its implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t \textless{} n/2 (where t is the maximal number of processes that may crash) is a necessary and Sufficient Requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper visits the notion of a fast implementation of an atomic register, and presents a new time-efficient asynchronous algorithm. Its time-efficiency is measured according to two different underlying synchrony assumptions. Whatever this assumption, a write operation always costs a round-trip delay, while a read operation costs always a round-trip delay in favorable circumstances (intuitively, when it is not concurrent with a write). When designing this algorithm, the design spirit was to be as close as possible to the one of the famous ABD algorithm (proposed by Attiya, Bar-Noy, and Dolev).
-
Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems
2016Co-Authors: Achour Mostefaoui, Michel RaynalAbstract:The atomic register is certainly the most basic object of computing science. Its implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t < n/2 (where t is the maximal number of processes that may crash) is a necessary and Sufficient Requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper visits the notion of a fast implementation of an atomic register, and presents a new time-efficient asynchronous algorithm. Its time-efficiency is measured according to two different underlying synchrony assumptions. Whatever this assumption, a write operation always costs a round-trip delay, while a read operation costs always a round-trip delay in favorable circumstances (intuitively, when it is not concurrent with a write). When designing this algorithm, the design spirit was to be as close as possible to the one of the famous ABD algorithm (proposed by Attiya, Bar-Noy, and Dolev).
Matthieu Roy - One of the best experts on this subject based on the ideXlab platform.
-
Time-efficient read/write register in crash-prone asynchronous message-passing systems
Computing, 2018Co-Authors: Achour Mostefaoui, Michel Raynal, Matthieu RoyAbstract:The atomic register is one of the most basic and useful object of computing science, and its simple read–write semantics is appealing when programming distributed systems. Hence, its implementation on top of crash-prone asynchronous message-passing systems has received a lot of attention. It was shown that having a strict minority of processes that may crash is a necessary and Sufficient Requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. This paper visits the notion of a fast implementation of an atomic register, and presents a new time-efficient asynchronous algorithm that reduces latency in many cases: a write operation always costs a round-trip delay, while a read operation costs a round-trip delay in favorable circumstances (intuitively, when it is not concurrent with a write). When designing this algorithm, the design spirit was to be as close as possible to the original algorithm proposed by Attiya, Bar-Noy, and Dolev.
Veronica Mazza - One of the best experts on this subject based on the ideXlab platform.
-
Individuation of object parts in aging
Attention Perception & Psychophysics, 2020Co-Authors: Chiara F. Tagliabue, Luigi Lombardi, Veronica MazzaAbstract:Research on enumeration with isolated objects has indicated that young and older adults can report up to three elements with similar efficiency (subitizing effect). Recent studies on subitizing in young adults have shown that individuation occurs over parts of an object as efficiently as over physically disconnected objects, suggesting that spatial separation is a Sufficient Requirement for efficient individuation. Do young and older adults share this Sufficient Requirement? In two experiments, we tested for the presence of subitizing in an enumeration task with a varying number of distinct objects and object parts. In Experiment 1 , results indicated the presence of a bilinear function (with an inflection point between 3 and 4 elements, a proxy for subitizing) in the response speed of young and older adults, and in both stimulus conditions. In addition, the enumeration slope in older participants was steeper for object parts than for objects in the subitizing range, possibly due to perceptual degradation (e.g., in contour detection). The pattern found generalizes to other stimuli (Experiment 2 ), thus highlighting the robustness of the present findings. Overall, the results indicate that while some perceptual factors (such as contour detection or curvature polarity) may hamper subitizing speed of older individuals relative to young adults, the subitizing span remains at approximately three to four elements for multiple objects and object parts in both young and older adults. Thus, individuation of multiple objects and object parts is a mechanism relatively resistant to aging.
-
Individuation of object parts in aging.
Attention perception & psychophysics, 2020Co-Authors: Chiara F. Tagliabue, Luigi Lombardi, Veronica MazzaAbstract:Research on enumeration with isolated objects has indicated that young and older adults can report up to three elements with similar efficiency (subitizing effect). Recent studies on subitizing in young adults have shown that individuation occurs over parts of an object as efficiently as over physically disconnected objects, suggesting that spatial separation is a Sufficient Requirement for efficient individuation. Do young and older adults share this Sufficient Requirement? In two experiments, we tested for the presence of subitizing in an enumeration task with a varying number of distinct objects and object parts. In Experiment 1, results indicated the presence of a bilinear function (with an inflection point between 3 and 4 elements, a proxy for subitizing) in the response speed of young and older adults, and in both stimulus conditions. In addition, the enumeration slope in older participants was steeper for object parts than for objects in the subitizing range, possibly due to perceptual degradation (e.g., in contour detection). The pattern found generalizes to other stimuli (Experiment 2), thus highlighting the robustness of the present findings. Overall, the results indicate that while some perceptual factors (such as contour detection or curvature polarity) may hamper subitizing speed of older individuals relative to young adults, the subitizing span remains at approximately three to four elements for multiple objects and object parts in both young and older adults. Thus, individuation of multiple objects and object parts is a mechanism relatively resistant to aging.
Chiara F. Tagliabue - One of the best experts on this subject based on the ideXlab platform.
-
Individuation of object parts in aging
Attention Perception & Psychophysics, 2020Co-Authors: Chiara F. Tagliabue, Luigi Lombardi, Veronica MazzaAbstract:Research on enumeration with isolated objects has indicated that young and older adults can report up to three elements with similar efficiency (subitizing effect). Recent studies on subitizing in young adults have shown that individuation occurs over parts of an object as efficiently as over physically disconnected objects, suggesting that spatial separation is a Sufficient Requirement for efficient individuation. Do young and older adults share this Sufficient Requirement? In two experiments, we tested for the presence of subitizing in an enumeration task with a varying number of distinct objects and object parts. In Experiment 1 , results indicated the presence of a bilinear function (with an inflection point between 3 and 4 elements, a proxy for subitizing) in the response speed of young and older adults, and in both stimulus conditions. In addition, the enumeration slope in older participants was steeper for object parts than for objects in the subitizing range, possibly due to perceptual degradation (e.g., in contour detection). The pattern found generalizes to other stimuli (Experiment 2 ), thus highlighting the robustness of the present findings. Overall, the results indicate that while some perceptual factors (such as contour detection or curvature polarity) may hamper subitizing speed of older individuals relative to young adults, the subitizing span remains at approximately three to four elements for multiple objects and object parts in both young and older adults. Thus, individuation of multiple objects and object parts is a mechanism relatively resistant to aging.
-
Individuation of object parts in aging.
Attention perception & psychophysics, 2020Co-Authors: Chiara F. Tagliabue, Luigi Lombardi, Veronica MazzaAbstract:Research on enumeration with isolated objects has indicated that young and older adults can report up to three elements with similar efficiency (subitizing effect). Recent studies on subitizing in young adults have shown that individuation occurs over parts of an object as efficiently as over physically disconnected objects, suggesting that spatial separation is a Sufficient Requirement for efficient individuation. Do young and older adults share this Sufficient Requirement? In two experiments, we tested for the presence of subitizing in an enumeration task with a varying number of distinct objects and object parts. In Experiment 1, results indicated the presence of a bilinear function (with an inflection point between 3 and 4 elements, a proxy for subitizing) in the response speed of young and older adults, and in both stimulus conditions. In addition, the enumeration slope in older participants was steeper for object parts than for objects in the subitizing range, possibly due to perceptual degradation (e.g., in contour detection). The pattern found generalizes to other stimuli (Experiment 2), thus highlighting the robustness of the present findings. Overall, the results indicate that while some perceptual factors (such as contour detection or curvature polarity) may hamper subitizing speed of older individuals relative to young adults, the subitizing span remains at approximately three to four elements for multiple objects and object parts in both young and older adults. Thus, individuation of multiple objects and object parts is a mechanism relatively resistant to aging.
