Art
J-GLOBAL ID:200902002031493140   Reference number:90A0558347

Optimal parallel merging and sorting algorithms using √N processors without memory contention.

メモリ競合のない√nのプロセッサを用いた最適並列マージング及びソーティング・アルゴリズム
Author (2):
Material:
Volume: 14  Issue:Page: 89-97  Publication year: May. 1990 
JST Material Number: A0440C  ISSN: 0167-8191  Document type: Article
Article type: 原著論文  Country of issue: Netherlands (NLD)  Language: ENGLISH (EN)
Thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,...
Semi thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=90A0558347&from=J-GLOBAL&jstjournalNo=A0440C") }}
JST classification (2):
JST classification
Category name(code) classified by JST.
Theory of computation  ,  System programmings in general 
Terms in the title (5):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page