skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Search For:
Clear Search Box
Search in:
Busca Geral
Or hit Enter to replace search target
Or select another collection:
Search in:
Busca Geral
Busca Avançada
Busca por Índices
This feature requires javascript
This feature requires javascript
A Data Communication Reliability and Trustability Study for Cluster Computing
Colmenares, Eduardo
2015
Texto completo disponível
Citações
Citado por
Exibir Online
Detalhes
Resenhas & Tags
Mais Opções
Nº de Citações
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
A Data Communication Reliability and Trustability Study for Cluster Computing
Autor:
Colmenares, Eduardo
Assuntos:
Computer Science
Notas:
No
2015 Oklahoma Supercomputing Symposium
http://hdl.handle.net/11244/20913
Descrição:
Biography Dr. Eduardo Colmenares is an Assistant Professor of Computer Science at Midwestern State University. He received his BS in Electronics Engineering from the Industrial University of Santander, Colombia, his Master of Science and PhD in Computer Science from Texas Tech University, both with Focus in High Performance Computing and Scientific Computing. For his doctoral work at Texas Tech University, Dr. Colmenares studied a kernel of scientific relevance in multiple fields of science, the All-Pairs Shortest Path (APSP) problem. He developed an algorithmically restructured solution for the APSP that makes use of non-blocking features supported by a heterogeneous multi-core architecture, in order to minimize the effects of the intense data sharing among processors and to target better performance than the traditional and pipelined approaches. Abstract In High Performance Computing (HPC), most of the problems under study will be either embarrassingly parallel or data dependent. Beyond the nature of the problem, scientists will be interested in either one or two additional characteristics. The first, performance, focuses in achieving an accurate solution in a fraction of the time of a sequential approach. The second is consecutive, accurate and steady time readings. In their quest for performance, some scientists forget not only that the chosen tool, in many cases a distributed-memory system, is a multi-user system, but also that its components are interconnected through a high-speed communications network to facilitate the interaction among processors. In this talk, we show why a cluster characterization is relevant, particularly for scientific kernels where multiple accurate and consecutive time readings are necessary to statistically validate a behavior. We present the characterization of two clusters by using two variants of the ping pong test. One of the clusters is a multi-user research oriented cluster, while the second is a one-user cluster with older technology. The University of Oklahoma; The University of Oklahoma Supercomputing Center for Education & Research (OSCER); The University of Oklahoma Department of Information Technology; 2015 Oklahoma Supercomputing Symposium; Midwestern State University
Data de criação/publicação:
2015
Idioma:
Inglês
Links
View record in University of Oklahoma$$FView record in $$GUniversity of Oklahoma
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(USP_VIDEOS),scope:("PRIMO"),scope:(USP_FISICO),scope:(USP_EREVISTAS),scope:(USP),scope:(USP_EBOOKS),scope:(USP_PRODUCAO),primo_central_multiple_fe
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript