✦ LIBER ✦

A parallel tree code

✍ Scribed by John Dubinski

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 847 KB
Volume: 1
Category: Article
ISSN: 1384-1076
DOI: 10.1016/s1384-1076(96)00009-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A work- and data-sharing parallel tree N

A work- and data-sharing parallel tree N-body code

✍ U. Becciani; V. Antonuccio-Delogu; A. Pagliaro 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 792 KB

We describe a new parallel N-body code for simulations of the formation and evolution of the large-scale structure of the Universe. The code is based on a work-and data-sharing scheme, and is implemented within the Cray Research Corporation's CRAFI "(~) programming environment. Different data distri

A parallel tree difference algorithm

✍ D.B. Skillicorn 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Order preserving code having a search tr

Order preserving code having a search tree

✍ Takashi Sato 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 708 KB

ParalleloGAM: a parallel code for ODEs

✍ Pierluigi Amodio; Luigi Brugnano 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 927 KB

A new parallel solver for ODES implementing a "parallelism across the steps" has been recently proposed in (Amodio and Brugnano, 1997; Brugnano and Trigiante, 1998), where it is shown that it is able to obtain an almost perfect speed-up on linear problems, and given mesh. A possible way to adapt thi

A simple parallel tree contraction algor

A simple parallel tree contraction algorithm

✍ K Abrahamson; N Dadoun; D.G Kirkpatrick; T Przytycka 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 952 KB

Drawing a tree on parallel lines

✍ R. Hirabayashi; Y.T. Ikebe; K. Iwamura; T. Nakayama 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 336 KB

We consider a problem of drawing a tree on parallel lines. In this problem we are given a tree and an infinite number of parallel lines in the plane. The object is to draw the tree so that (i) each vertex is placed on one of the given parallel lines, (ii) no two edges intersect, and (iii) the 'heigh