Abstract :
Abstract—This note discusses possible advantages to be gained through use of associative memory in finding the shortest path through a large graph having edges of unequal lengths. An algorithm is described which exploits associative memory´s highly parallel search and arithmetic capabilities and which is economical in storage requirements.
Keywords :
Index terms—Associative and content-adressable memory, graphs, highly parallel processing, shortest-path problem.; Arithmetic; Associative memory; Cranes; Labeling; Parallel processing; Tail; Telephony; Index terms—Associative and content-adressable memory, graphs, highly parallel processing, shortest-path problem.;
