An O(1) solution to the prefix sum problem on a specialized memory architecture

Autores
Brodnik, Andrej; Karlsson, Johan; Munro, J. Ian; Nilsson, Andreas
Año de publicación
2006
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to perform both update and retrieval in O(1) time simultaneously under a memory model in which individual bits may be shared by several words. We also show that two variants (generalizations) of the problem can be solved optimally in Θ (lgN) time under the comparison based model of computation.
4th IFIP International Conference on Theoretical Computer Science
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
random access machine (RAM)
Modeling
Bounded-action devices (e.g., Turing machines, random access machines)
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/24379
Acceder
id SEDICI_31dcc246e22d70ce871ed4e146a11ffe
oai_identifier_str oai:sedici.unlp.edu.ar:10915/24379
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling An O(1) solution to the prefix sum problem on a specialized memory architectureBrodnik, AndrejKarlsson, JohanMunro, J. IanNilsson, AndreasCiencias Informáticasrandom access machine (RAM)ModelingBounded-action devices (e.g., Turing machines, random access machines)In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to perform both update and retrieval in O(1) time simultaneously under a memory model in which individual bits may be shared by several words. We also show that two variants (generalizations) of the problem can be solved optimally in Θ (lgN) time under the comparison based model of computation.4th IFIP International Conference on Theoretical Computer ScienceRed de Universidades con Carreras en Informática (RedUNCI)2006-08info: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/24379enginfo:eu-repo/semantics/altIdentifier/isbn/0-387-34633-3info: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:50Zoai:sedici.unlp.edu.ar:10915/24379Institucionalhttp://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:50.374SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv An O(1) solution to the prefix sum problem on a specialized memory architecture
title An O(1) solution to the prefix sum problem on a specialized memory architecture
spellingShingle An O(1) solution to the prefix sum problem on a specialized memory architecture
Brodnik, Andrej
Ciencias Informáticas
random access machine (RAM)
Modeling
Bounded-action devices (e.g., Turing machines, random access machines)
title_short An O(1) solution to the prefix sum problem on a specialized memory architecture
title_full An O(1) solution to the prefix sum problem on a specialized memory architecture
title_fullStr An O(1) solution to the prefix sum problem on a specialized memory architecture
title_full_unstemmed An O(1) solution to the prefix sum problem on a specialized memory architecture
title_sort An O(1) solution to the prefix sum problem on a specialized memory architecture
dc.creator.none.fl_str_mv Brodnik, Andrej
Karlsson, Johan
Munro, J. Ian
Nilsson, Andreas
author Brodnik, Andrej
author_facet Brodnik, Andrej
Karlsson, Johan
Munro, J. Ian
Nilsson, Andreas
author_role author
author2 Karlsson, Johan
Munro, J. Ian
Nilsson, Andreas
author2_role author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
random access machine (RAM)
Modeling
Bounded-action devices (e.g., Turing machines, random access machines)
topic Ciencias Informáticas
random access machine (RAM)
Modeling
Bounded-action devices (e.g., Turing machines, random access machines)
dc.description.none.fl_txt_mv In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to perform both update and retrieval in O(1) time simultaneously under a memory model in which individual bits may be shared by several words. We also show that two variants (generalizations) of the problem can be solved optimally in Θ (lgN) time under the comparison based model of computation.
4th IFIP International Conference on Theoretical Computer Science
Red de Universidades con Carreras en Informática (RedUNCI)
description In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to perform both update and retrieval in O(1) time simultaneously under a memory model in which individual bits may be shared by several words. We also show that two variants (generalizations) of the problem can be solved optimally in Θ (lgN) time under the comparison based model of computation.
publishDate 2006
dc.date.none.fl_str_mv 2006-08
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/24379
url http://sedici.unlp.edu.ar/handle/10915/24379
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/isbn/0-387-34633-3
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_ 1844615818046865408
score 13.070432

Publicaciones similares