scholarly journals An O (log 3/2 n ) Parallel Time Population Protocol for Majority with O (log n ) States

2020 ◽  
Author(s):  
Stav Ben-Nun ◽  
Tsvi Kopelowitz ◽  
Matan Kraus ◽  
Ely Porat
Keyword(s):  
Parallel Time ◽  
Population Protocol

Highly parallel time integration of viscoelastic flows

2001 ◽  
Vol 100 (1-3) ◽  
pp. 191-216 ◽  
Author(s):  
A.E. Caola ◽  
Y.L. Joo ◽  
R.C. Armstrong ◽  
R.A. Brown
Keyword(s):  
Time Integration ◽  
Viscoelastic Flows ◽  
Parallel Time

Evaluating uniform expressions within two steps of minimum parallel time

1997 ◽  
Vol 44 (2) ◽  
pp. 345-361
Author(s):  
Robert A. Wagner
Keyword(s):  
Parallel Time

CALCULATING RECURRENCES USING THE BIRD-MEERTENS FORMALISM

1995 ◽  
Vol 05 (02) ◽  
pp. 179-190 ◽  
Author(s):  
WENTONG CAI ◽  
DAVID B. SKILLICORN
Keyword(s):  
Software Development ◽  
Parallel Algorithms ◽  
Time Complexity ◽  
Large Range ◽  
Parallel Solution ◽  
Parallel Time

The Bird-Meetens formalism is an approach to software development and computation based on datatype theories. In this paper we build new operators for the theory of lists that compute generalized recurrences and show that they have logarithmic parallel time complexity. As many applications can be cast as forms of recurrences, this allows a large range of parallel algorithms to be derived within the Bird-Meertens formalism. We illustrate by deriving a parallel solution to the maximum segment sum problem.

scholarly journals Leader Election Requires Logarithmic Time in Population Protocols

2020 ◽  
Vol 30 (01) ◽  
pp. 2050005 ◽  
Author(s):  
Yuichi Sudo ◽  
Toshimitsu Masuzawa
Keyword(s):  
Lower Bound ◽  
High Probability ◽  
Leader Election ◽  
Stabilization Time ◽  
Population Protocols ◽  
Population Protocol ◽  
Time Optimal ◽  
Exact Size

This paper shows that every leader election protocol requires logarithmic stabilization time both in expectation and with high probability in the population protocol model. This lower bound holds even if each agent has knowledge of the exact size of a population and is allowed to use an arbitrarily large number of agent states. This lower bound concludes that the protocol given in [Sudo et al., SSS 2019] is time-optimal in expectation.

scholarly journals Logarithmic Expected-Time Leader Election in Population Protocol Model

2019 ◽  
pp. 323-337 ◽  
Author(s):  
Yuichi Sudo ◽  
Fukuhito Ooshita ◽  
Taisuke Izumi ◽  
Hirotsugu Kakugawa ◽  
Toshimitsu Masuzawa
Keyword(s):  
Leader Election ◽  
Expected Time ◽  
Population Protocol

scholarly journals Parallel time courses of acetylcholine-induced releases of catecholamine and enkephalin-like immunoreactive peptides from perfused dog adrenal glands

1983 ◽  
Vol 4 (4) ◽  
pp. 413-416 ◽  
Author(s):  
NAOTO ASADA ◽  
TOSHIYUKI SAITO ◽  
TOMIO KANNO ◽  
KAZUWA NAKAO ◽  
TAKAAKI YOSHIMASA ◽  
...  
Keyword(s):  
Parallel Time ◽  
Time Courses
Sign in / Sign up

Export Citation Format

Share Document