Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3124481

Algorithms for search trees on message-passing architectures

Author
COLBROOK, A1 ; BREWER, E. A; DELLAROCAS, C. N; WEIHL, W. E
[1] Smith System Engineering, United States
Source

IEEE transactions on parallel and distributed systems. 1996, Vol 7, Num 2, pp 97-108 ; ref : 20 ref

CODEN
ITDSEO
ISSN
1045-9219
Scientific domain
Electronics; Computer science
Publisher
IEEE Computer Society, Los Alamitos, CA
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Algorithme parallèle Algorithme recherche Arbre recherche Blocage Calculateur MIMD Communication Processeur Simulateur Synchronisation Transmission message Balanced search trees Dictionary abstract data type Linear processor array Query response time Query throughput
Keyword (en)
Parallel algorithm Search algorithm Search tree Blocking MIMD computer Communication Processor Simulator Synchronization Message transmission
Keyword (es)
Algoritmo paralelo Algoritmo búsqueda Arbol investigación Bloqueo Comunicación Procesador Simulador Sincronización Transmisión mensaje
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A06 Information retrieval. Graph

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B04 Computer systems and distributed systems. User interface

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
3124481

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web