Back to Results
First PageMeta Content
Applied mathematics / Search algorithms / Parallel computing / Computing / Routing algorithms / Dijkstra / Algorithm / Mathematics


Parallel algorithms for geometric shortest path problems
Add to Reading List

Document Date: 2004-10-08 01:07:33


Open Document

File Size: 3,90 MB

Share Result on Facebook

Currency

pence / /

Facility

Informatics University of Edinburgh / /

IndustryTerm

2x1 processors / 1x1 processors / 2x2 processors / Parallel algorithms / path algorithms / synchronous parallel algorithm / 3x3 processors / shortest path algorithms / asynchronous parallel algorithm / /

Organization

Science Computer Science School / University of Edinburgh / /

Person

Murray Cole / /

Position

supervisor / /

ProgrammingLanguage

C / K / /

Technology

shared memory system / 1 1.2 Shortest path algorithms / 53 5.4 Algorithm / synchronous parallel algorithm / asynchronous parallel algorithm / 61 5.12 Algorithm / 54 5.5 Algorithm / 56 5.7 Algorithm / 114 C.2 Algorithm / 5.3 51 52 Algorithm / 60 5.11 Algorithm / API / 1x1 processors / 55 5.6 Algorithm / 19 Maximum Thread Algorithm / 48 Technology / shortest path algorithms / 21 Algorithms / 2x2 processors / 3.1 25 Technologies / 5.2 Algorithm / 2x1 processors / 34 5.1 Algorithm / Lanthier algorithm / 117 C.7 Algorithm / 62 5.13 Algorithm / 33 Algorithms / shared memory / 1.2 Algorithm / 3x3 processors / 58 5.9 Algorithm / 59 5.10 Algorithm / 114 C.1 Algorithm / using shared memory / /

SocialTag