A carregar...

On the Organization of Parallel Operation of Some Algorithms for Finding the Shortest Path on a Graph on a Computer System with Multiple Instruction Stream and Single Data Stream

The paper considers the implementing Bellman-Ford and Lee algorithms to find the shortest graph path on a computer system with multiple instruction stream and single data stream (MISD). The MISD computer is a computer that executes commands of arithmetic-logical processing (on the CPU) and commands...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Autor principal: V. E. Podol'skii
Formato: Artigo
Idioma:Russo
Publicado em: MGTU im. N.È. Baumana 2015-01-01
Colecção:Nauka i Obrazovanie
Assuntos:
Acesso em linha:http://technomag.edu.ru/jour/article/view/320
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!