Wednesday, October 1, 2014

 

 



Soy un nuevo usuario

Olvidé mi contraseña

Entrada usuarios

Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida
Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía
Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía
Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía


Amit Chhabra, Gurvinder Singh Analysis & Integrated Modeling of the Performance Evaluation Techniques for Evaluating Parallel Systems

1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario
    registrado en Universia


  Descargar recurso

Detalles del recurso

Pertenece a: CiteSeerX Scientific Literature Digital Library and Search Engine  

Descripción: Parallel computing has emerged as an environment for computing inherently parallel and computation intensive applications. Performance is always a key factor in determining the success of any system. So parallel computing systems are no exception. Evaluating and analyzing the performance of parallel systems is an important aspect of parallel computing research. Evaluating and analyzing parallel system is difficult due to the complex interaction between application characteristics and architectural features. Experimental measurement, Theoretical/Analytical modeling and Simulation are the most widely used techniques in the performance evaluation of parallel systems. Experimental measurement uses real or synthetic workloads, usually known as benchmarks, to evaluate and analyze their performance on actual hardware. Theoretical/Analytical models try to abstract details of a parallel system. Simulation and other performance monitoring/visualization tools are extremely popular because they can capture the dynamic nature of the interaction between applications and architectures. Each of them has several types. For example, Experimental measurement has software,

Autor(es): Amit Chhabra -  Gurvinder Singh - 

Id.: 45736078

Idioma: English  - 

Versión: 1.0

Estado: Final

Tipo:  application/pdf - 

Palabras claveIntegrated model - 

Tipo de recurso: Texto Narrativo  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

: Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Formatos:  application/pdf - 

Requerimientos técnicos:  Browser: Any - 

Relación: [IsBasedOn] http://ijcss.org/Volume1/Issue1/V1_I1_001.pdf
[References] 10.1.1.17.330
[References] 10.1.1.33.8570

Fecha de contribución: 28-jul-2011

Contacto:

Localización:


Otros recursos del mismo autor(es)

  1. Advanced Operator Splitting Based Semiimplicit spectral method to solve the Binary and Single component Phase-Field We present extensive testing in order to find the optimum balance among errors associated with time ...
  2. An Efficient Adaptive Space-Sharing Policy for Non-dedicated Heterogeneous Cluster Systems The existing adaptive space-sharing scheduling algorithms mainly focus on dedicated homogeneous clus...
  3. Molecular Cloning and Nucleotide Sequence of the Gene for an Alkaline Protease from Bacillus circulans MTCC 7906 Bacillus circulans MTCC 7906, an extracellular alkaline protease producer was genetically characteri...
  4. A Study on Early Prediction of Fault Proneness in Software Modules using Genetic Algorithm Abstract—Fault-proneness of a software module is the probability that the module contains faults. To...
  5. Job Scheduling Algorithms for PC-cluster using Design of Experiments (DOE) Parallel space-sharing job scheduling algorithms play an indispensible role in efficient allocation ...

Otros recursos de la misma colección

  1. Speeding up Subgroup Cryptosystems
  2. Geometrical methods for non-negative ICA: Manifolds, Lie groups and toral subalgebras
  3. Making a fast unstable sorting algorithm stable This paper demonstrates how an unstable in place sorting algorithm, the ALR algorithm, can be made s...
  4. RAMSEY PROPERTIES OF RANDOM k-PARTITE k-UNIFORM HYPERGRAPHS We investigate the threshold probability for the property that every r-coloring of the edges of a ra...
  5. Computing Division Using Single-Electron Tunneling Technology Emerging nanotechnologies, like single-electron tunneling (SET) technology, possesses properties tha...

Valoración de los usuarios

No hay ninguna valoración para este recurso.Sea el primero en valorar este recurso.
 

Busque un recurso