On bulk-synchronous distributed-memory parallel processing of relational-database transactions

Autores
Marín, Mauricio; Casas, Sandra
Año de publicación
2001
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
This paper describes two parallel algorithms for the eÆcient processing of relational database transactions and presents a performance analysis of them. These algorithms are built upon the bulk-synchronous parallel model of computation. The well-de ned structure of this model enabled us to evaluate their performance by using an implementation independent and yet em- pirical approach which includes the e ects of synchronization, communication and computation. The analysis reveals that the algorithm which borrows ideas from optimistic parallel discrete event simulation achieves better performance than the classical approach for synchronizing con- current transactions on a distributed memory system.
Eje: Programación concurrente
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
relational database transactions
distributed memory
Parallel processing
Parallel algorithms
Concurrent Programming
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/23326
Acceder
id SEDICI_410f0abcc1e7feb5ba1b10bebcbbdc9b
oai_identifier_str oai:sedici.unlp.edu.ar:10915/23326
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling On bulk-synchronous distributed-memory parallel processing of relational-database transactionsMarín, MauricioCasas, SandraCiencias Informáticasrelational database transactionsdistributed memoryParallel processingParallel algorithmsConcurrent ProgrammingThis paper describes two parallel algorithms for the eÆcient processing of relational database transactions and presents a performance analysis of them. These algorithms are built upon the bulk-synchronous parallel model of computation. The well-de ned structure of this model enabled us to evaluate their performance by using an implementation independent and yet em- pirical approach which includes the e ects of synchronization, communication and computation. The analysis reveals that the algorithm which borrows ideas from optimistic parallel discrete event simulation achieves better performance than the classical approach for synchronizing con- current transactions on a distributed memory system.Eje: Programación concurrenteRed de Universidades con Carreras en Informática (RedUNCI)2001-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/23326enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:55:25Zoai:sedici.unlp.edu.ar:10915/23326Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:55:25.899SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv On bulk-synchronous distributed-memory parallel processing of relational-database transactions
title On bulk-synchronous distributed-memory parallel processing of relational-database transactions
spellingShingle On bulk-synchronous distributed-memory parallel processing of relational-database transactions
Marín, Mauricio
Ciencias Informáticas
relational database transactions
distributed memory
Parallel processing
Parallel algorithms
Concurrent Programming
title_short On bulk-synchronous distributed-memory parallel processing of relational-database transactions
title_full On bulk-synchronous distributed-memory parallel processing of relational-database transactions
title_fullStr On bulk-synchronous distributed-memory parallel processing of relational-database transactions
title_full_unstemmed On bulk-synchronous distributed-memory parallel processing of relational-database transactions
title_sort On bulk-synchronous distributed-memory parallel processing of relational-database transactions
dc.creator.none.fl_str_mv Marín, Mauricio
Casas, Sandra
author Marín, Mauricio
author_facet Marín, Mauricio
Casas, Sandra
author_role author
author2 Casas, Sandra
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
relational database transactions
distributed memory
Parallel processing
Parallel algorithms
Concurrent Programming
topic Ciencias Informáticas
relational database transactions
distributed memory
Parallel processing
Parallel algorithms
Concurrent Programming
dc.description.none.fl_txt_mv This paper describes two parallel algorithms for the eÆcient processing of relational database transactions and presents a performance analysis of them. These algorithms are built upon the bulk-synchronous parallel model of computation. The well-de ned structure of this model enabled us to evaluate their performance by using an implementation independent and yet em- pirical approach which includes the e ects of synchronization, communication and computation. The analysis reveals that the algorithm which borrows ideas from optimistic parallel discrete event simulation achieves better performance than the classical approach for synchronizing con- current transactions on a distributed memory system.
Eje: Programación concurrente
Red de Universidades con Carreras en Informática (RedUNCI)
description This paper describes two parallel algorithms for the eÆcient processing of relational database transactions and presents a performance analysis of them. These algorithms are built upon the bulk-synchronous parallel model of computation. The well-de ned structure of this model enabled us to evaluate their performance by using an implementation independent and yet em- pirical approach which includes the e ects of synchronization, communication and computation. The analysis reveals that the algorithm which borrows ideas from optimistic parallel discrete event simulation achieves better performance than the classical approach for synchronizing con- current transactions on a distributed memory system.
publishDate 2001
dc.date.none.fl_str_mv 2001-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/23326
url http://sedici.unlp.edu.ar/handle/10915/23326
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844615813159452672
score 13.069144

Publicaciones similares