Bus based parallel computers: a viable way for massive parallelism (1994)
- Authors:
- USP affiliated authors: FERREIRA, AFONSO GALVAO - IME ; LEJBMAN, ALFREDO GOLDMAN VEL - IME ; SONG, SIANG WUN - IME
- Unidade: IME
- DOI: 10.1007/3-540-58184-7_130
- Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Proceedings
- Conference titles: International Conference on Parallel Architectures and Languages Europe
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
FERREIRA, Afonso Galvão e GOLDMAN, Alfredo e SONG, Siang Wun. Bus based parallel computers: a viable way for massive parallelism. 1994, Anais.. Berlin: Springer, 1994. Disponível em: https://doi.org/10.1007/3-540-58184-7_130. Acesso em: 28 mar. 2024. -
APA
Ferreira, A. G., Goldman, A., & Song, S. W. (1994). Bus based parallel computers: a viable way for massive parallelism. In Proceedings. Berlin: Springer. doi:10.1007/3-540-58184-7_130 -
NLM
Ferreira AG, Goldman A, Song SW. Bus based parallel computers: a viable way for massive parallelism [Internet]. Proceedings. 1994 ;[citado 2024 mar. 28 ] Available from: https://doi.org/10.1007/3-540-58184-7_130 -
Vancouver
Ferreira AG, Goldman A, Song SW. Bus based parallel computers: a viable way for massive parallelism [Internet]. Proceedings. 1994 ;[citado 2024 mar. 28 ] Available from: https://doi.org/10.1007/3-540-58184-7_130 - Broadcasting in bus interconnection networks
- Achieving optimality for gate matrix layout and pla folding: a graph theoretic approach
- Graph theoretic approach for pla area optimization
- Achieving optimality for gate matrix layout and pla folding: a graph theoretical approach
- Graph theoretic approach for pla area optimization
- Comunicacao em hipergrades e hipertoros usando barramentos
- Achieving optimality for gate matrix layout and pla folding: a graph theoretic approach
- Efficient parallel graph algoritms for coarse-grained multicomputers and BSP
- Generating permutations on a VLSI suitable linear network
- 2-list algorithm for the knapsack problem on a fpst20
Informações sobre o DOI: 10.1007/3-540-58184-7_130 (Fonte: oaDOI API)
Download do texto completo
Tipo | Nome | Link | |
---|---|---|---|
973140.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas