Scatter storage techniques

Morris, Robert

doi:10.1145/362851.362882

Cited by 166 publications

(27 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The method was originally conceived by Morris [16]. The goal of the method is to construct a bit field that can be used to identify whether the current state has been visited already.…”

Section: Bit State Hashingmentioning

confidence: 99%

Model checking of emergent behaviour properties of robot swarms

Juurik¹,

Vain²

2011

Proc. Estonian Acad. Sci.

View full text Add to dashboard Cite

This paper presents a case study on scalability of explicit state model checking. Three state space reduction methodsstate vector compression, bit state hashing, and symmetry reduction -were applied on an exercise with the objective of verifying a distributed coordination algorithm for robot swarms. Based on the analysis results, the feasibility of using explicit state model checking to prove properties of large multi-agent systems is questioned and the limitations faced in verifying a dynamic cleaning algorithm are outlined.

show abstract

“…The method was originally conceived by Morris [16]. The goal of the method is to construct a bit field that can be used to identify whether the current state has been visited already.…”

Section: Bit State Hashingmentioning

confidence: 99%

Model checking of emergent behaviour properties of robot swarms

Juurik¹,

Vain²

2011

Proc. Estonian Acad. Sci.

View full text Add to dashboard Cite

show abstract

“…The method of generating a random number is that suggested by Morris [2], where N = 2" is the size of the table. (e) If address determined by (d) is full, return to (c); otherwise make the entry and stop.…”

Section: Modified Quadratic Searchmentioning

confidence: 99%

“…k + Im, k + 2m, • • • , etc. Morris [2] haa indicated that this search is the least effective strategy in common use. Clearly, H k = k + 2m for two hash addresses, k' and k, then the search for k proceeds over the same sequence of locations as the search for fc.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The use of quadratic residue research

Radke

1970

Commun. ACM

View full text Add to dashboard Cite

A quadratic residue search method has previously been suggested to avoid the clustering usually encountered when hash address collisions occur and linear search methods are used. The search size, because of the property of quadratic residues, is limited to one half of the storage table. It is shown that for some classes of prime numbers the complement of the set of quadratic residues can easily be determined and hence the entire table of size p, where p is that prime number, can be searched.The principles of address calculation and merging are combined to yield an efficient sorting technique. Detailed flowcharts of the most important program steps are included. The characteristics of the proposed sort are discussed.

show abstract

“…The reader is assumed familiar with the problem of record addressing [1,6,7,9,12] and with the interaction of those system elements illustrated in Figure I. The major sections of this paper are related to this figure.…”

Section: Introductionmentioning

confidence: 99%

A practitioner's guide to addressing algorithms

Severance

Duhne

1976

Commun. ACM

View full text Add to dashboard Cite

This paper consolidates a number of popular rules of thumb which have been suggested for the design of record addressing algorithms, and discusses the applicability of these rules to large commercial databases. Guidelines for selecting identifier transformations, overflow techniques, loading factors, bucket sizes, and loading order are considered. Particular attention is focused on the reasonableness of common heuristics for determining primary or secondary bucket sizes. A mathematical model which explicitly considers storage device characteristics and time/space cost tradeoffs is used to analyze the effect of design parameters on overall system costs. A specific design example is presented and solved.

show abstract

Scatter storage techniques

Cited by 166 publications

References 4 publications

Model checking of emergent behaviour properties of robot swarms

Model checking of emergent behaviour properties of robot swarms

The use of quadratic residue research

A practitioner's guide to addressing algorithms

Contact Info

Product

Resources

About