A fast maximum finding algorithm on broadcast communication

Chiau, Shyue-Horng; Yang, Chang‐Biau

doi:10.1007/bfb0030868

Cited by 4 publications

(15 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The method of analysis has been used in our previous papers [15]. By the method, the analyzes of the two algorithms form a platform for comparing with each other on the average time complexity.…”

Section: Analysis Of Nakano and Olariu's Algorithm With The Layer Conmentioning

confidence: 99%

“…Some researchers regarded the model as the broadcast communication model [3-5, 7, 12, 15-19, 21, 22, 25, 26]. In the WNCD model some important and essential components have been investigated such as sorting algorithms [3,4,6,14,19,26], maximum finding algorithm [5,15] and graph algorithms [22,23,25]. The initialization problem [8,9] was discussed recently.…”

Section: Introductionmentioning

confidence: 99%

“…The second concept to reduce conflict resolution time is the layer concept proposed by Yang [22]. To apply the layer concept for finding the maximum among a set of n numbers [15], we can improve the time complexity from Θ(log 2 n) to Θ(log n) [16]. Thus applying the two concepts, we can improve the time complexity for solving other problems in the WNCD model.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Fast Initialization Algorithm for Single-Hop Wireless Networks

Shiau¹

2005

IEICE Transactions on Communications

View full text Add to dashboard Cite

Given a set of n stations, the initialization problem is to assign each station a unique identification number, from 1 to n. In the single-hop wireless Networks with collision detection, Nakano and Olariu proposed an algorithm to build a partition tree and solve the problem. In this paper, we shall classify the partition tree into four parts. By reviewing the classifications, we find that three ideas can improve the algorithm. We show that it needs 2.88n time slots for solving the problem containing n stations. After applying our three ideas, the number of time slots will be improved to 2.46n.

show abstract

Section: Analysis Of Nakano and Olariu's Algorithm With The Layer Conmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Fast Initialization Algorithm for Single-Hop Wireless Networks

Shiau¹

2005

IEICE Transactions on Communications

View full text Add to dashboard Cite

show abstract

“…The first algorithm finds the maximal number present in the file. Such an algorithm per se appeared in [12,4]. It needs several rounds of recursive coin flippings; after each Date: February 19, 2004.…”

Section: Introductionmentioning

confidence: 99%

“…See [3] for some background on such integrals. The average number of rounds M n to find the maximum [12,4] is given by…”

Section: Introductionmentioning

confidence: 99%

Sorting algorithms for broadcast communications: mathematical analysis

Grabner

Prodinger

2002

Theoretical Computer Science

View full text Add to dashboard Cite

Assume that n persons communicate via a channel; to each person a certain number is attached, and the goal is to see the numbers of all persons, e. g. in order to sort them. In this paper three algorithms to achieve this are analyzed with respect to the average number of rounds. While a precise description of the algorithmic aspects can be found in the companion paper [14], we concentrate here on the mathematical aspects of the analysis. The quantities of interest can be written as certain contour integrals involving zeta functions. The numerical evaluation leads first via residues to extremely slowly converging series, and the acceleration of them is a nontrivial task that is done in a slightly more general fashion in order to fit all the applications.

show abstract

Modeling and Efficient Verification of Broadcasting Actors

Yousefi

Ghassemi

Khosravi

2015

Fundamentals of Software Engineering

View full text Add to dashboard Cite

Many distributed systems use broadcast communication for various reasons such as saving energy or increasing throughput. However, the actor model for concurrent and distributed systems does not directly support this kind of communication. In such cases, a broadcast must be modeled as multiple unicasts which leads to loss of modularity and state space explosion for any non-trivial system. In this paper, we extend Rebeca, an actor-based model language, to support asynchronous anonymous message broadcasting. Then, we apply counter abstraction for reducing the state space which efficiently bypasses the constructive orbit problem by considering the global state as a vector of counters, one per each local state. This makes the model checking of systems possible without further considerations of symmetry. This approach is efficient for fully symmetric system like broadcasting environments. We use a couple of case studies to illustrate the applicability of our method and the way their state spaces are reduced in size.

show abstract

A fast maximum finding algorithm on broadcast communication

Cited by 4 publications

References 9 publications

A Fast Initialization Algorithm for Single-Hop Wireless Networks

A Fast Initialization Algorithm for Single-Hop Wireless Networks

Sorting algorithms for broadcast communications: mathematical analysis

Modeling and Efficient Verification of Broadcasting Actors

Contact Info

Product

Resources

About