Friday, July 3, 2015

 

 



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


Architectures for Parallel Query Processing on Networks of Workstations

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: Networks of workstations (NOWs) are cost-effective alternatives to multiprocessor systems. Recently, NOWs have been proposed for parallel query processing. This paper explores the various architectures for using NOWs for parallel query processing. We start our discussion with two basic architectures: centralized and distributed. We identify the advantages and disadvantages associated with these architectures. Then we propose a hierarchical architecture that inherits the merits of the centralized and distributed architectures while minimizing the associated pitfalls. We also discuss the performance and research issues that require attention in all three architectures. Key words: Parallel query processing, Networks of workstations, Hierarchical architecture, Load sharing, Processor allocation, Databases 1 Introduction Relational databases have been the primary source of information repository for a very long time, and the support for querying this stored information is known as databa...

Autor(es): Sivarama P. Dandamudi -  Sivarama P. D -  Gautam Jain - 

Id.: 46505107

Idioma: English  - 

Versión: 1.0

Estado: Final

Tipo:  application/postscript - 

Palabras claveKey words - 

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/postscript - 

Requerimientos técnicos:  Browser: Any - 

Relación: [IsBasedOn] http://www.scs.carleton.ca/~jain/publications/ArchNOW.ps
[References] 10.1.1.37.4262
[References] 10.1.1.48.3099
[References] 10.1.1.56.8624
[References] 10.1.1.55.6766
[References] 10.1.1.2.1825
[References] 10.1.1.91.8837
[References] 10.1.1.99.3739

Fecha de contribución: 29-jul-2009

Contacto:

Localización:


Otros recursos del mismo autor(es)

  1. Using Networks of Workstations for Database Query Operations Performance of database systems can be improved by applying parallel processing techniques. Several ...
  2. Performance Comparison of Processor Scheduling Strategies in a Distributed-Memory Multicomputer System Abstract — Processor scheduling has received con-siderable attention in the context of shared-memory...
  3. Performance Evaluation of a Two-Level Hierarchical Parallel Database System Two typical architectures of parallel database systems are the shared-everything and shared-nothing ...
  4. The Impact of Program Structure on the Performance of Scheduling Policies in Multiprocessor Systems A simple fork and join type of job structure has been extensively used for performance evaluation of...
  5. A Hierarchical Processor Scheduling Policy for Distributed-Memory Multicomputer Systems Processor scheduling policies for distributedmemory systems can be divided into space-sharing or tim...

Otros recursos de la misma colección

  1. h-Monotonically Computable Real Numbers Let h: N → Q be a computable function. A real number x is called h-monotonically computable (h-mc, f...
  2. Effective Jordan Decomposition The Jordan decomposition Theorem says that any real function of bounded variation can be expressed a...
  3. h-Monotonically Computable Real Numbers
  4. Finite-State Dimension and Real Arithmetic We use entropy rates and Schur concavity to prove that, for every integer k ≥ 2, every nonzero ratio...
  5. On the Turing degrees of weakly computable real numbers The Turing degree of a real number x is defined as the Turing degree of its binary expansion. This d...

Valoración de los usuarios

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

Busque un recurso