Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP Model

@inproceedings{Bumker1996RealisticPA,
  title={Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP Model},
  author={Armin B{\"a}umker and Wolfgang Dittrich and Friedhelm Meyer auf der Heide and Ingo Rieping},
  booktitle={Euro-Par, Vol. II},
  year={1996}
}
In this paper, we explore parallel implementations of the abstract data type priority queue. We use the BSP* model, an extension of Valiant's BSP model which rewards blockwise communication, i.e. sending a few large messages instead of many small ones. We present two randomized approaches for diierent relations between the size of the data structure and the number of parallel updates to be performed. Both yield work optimal algorithms that need asymptotically less communication than computation… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Data Structures and Network Algorithms

  • R. E. Tarjan
  • Society for Industrial and applied Mathematics…
  • 1983
Highly Influential
3 Excerpts

Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model

  • A. B aumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping
  • Technical Report University of Paderborn,
  • 1996
1 Excerpt

Realit atsnahe parallele Priority Queues, Analyse und experimentelleUntersuchungen

  • I. Rieping
  • Diploma Thesis, University of Paderborn, January,
  • 1996
1 Excerpt

J

  • D. A. Bader
  • J aJ a. Practical Parallel Algorithms for…
  • 1995
1 Excerpt

Truly E cient Parallel Algorithms: c Optimal Multisearch for an Extension of the BSP model

  • A. B aumker, W. Dittrich, F. Meyer auf der Heide
  • Proc. of European Symposium on Algorithms,
  • 1995
2 Excerpts

Similar Papers

Loading similar papers…