[1990] Proceedings. The 17th Annual International Symposium on Computer Architecture最新文献

筛选

英文中文

Memory consistency and event ordering in scalable shared-memory multiprocessors 可扩展共享内存多处理器中的内存一致性和事件排序

[1990] Proceedings. The 17th Annual International Symposium on Computer Architecture Pub Date : 1900-01-01 DOI: 10.1145/285930.285997

K. Gharachorloo, D. Lenoski, J. Laudon, Phillip B. Gibbons, Anoop Gupta, J. Hennessy

引用次数: 451

Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers 通过添加一个小的全关联缓存和预取缓冲区来提高直接映射缓存的性能

[1990] Proceedings. The 17th Annual International Symposium on Computer Architecture Pub Date : 1900-01-01 DOI: 10.1109/ISCA.1990.134547

N. Jouppi

引用次数: 1447

A new approach to fast control of r/sup 2/*r/sup 2/ 3-stage Benes networks of r*r crossbar switches 一种快速控制r*r交叉开关r/sup 2/*r/sup 2/ 3级Benes网络的新方法

[1990] Proceedings. The 17th Annual International Symposium on Computer Architecture Pub Date : 1900-01-01 DOI: 10.1109/ISCA.1990.134507

A. Youssef, B. Arden

{"title":"A new approach to fast control of r/sup 2/*r/sup 2/ 3-stage Benes networks of r*r crossbar switches","authors":"A. Youssef, B. Arden","doi":"10.1109/ISCA.1990.134507","DOIUrl":"https://doi.org/10.1109/ISCA.1990.134507","url":null,"abstract":"The authors introduce an approach to fast control of N*N three-stage Benes networks of r*r crossbar switches as building blocks. The approach consists of setting the leftmost column of switches to an appropriately chosen configuration so that the network becomes self-routed while still able to realize a given family of permutations. This approach requires that, for any given family of permutations, a configuration for the leftmost column be found. Such a family is called compatibles; and the configuration of the leftmost column is called the compatibility factor. Compatibility is characterized, and a technique to determine compatibility and the compatibility factor is developed and applied to Omega -realizable permutations, the permutations needed to emulate a hypercube, and the families of permutations required by FFT, bitonic sorting, tree computations, multidimensional mesh and torus computations, and multigrid computations. An O(log/sup 2/N) time routing algorithm for the three-stage Benes is also developed. Finally, since only three compatibility factors are required by the preceding families of permutations, it is proposed that the first column be replaced by three multiplexed connections yielding a self-routing network with strong communication capabilities.<<ETX>>","PeriodicalId":297046,"journal":{"name":"[1990] Proceedings. The 17th Annual International Symposium on Computer Architecture","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127543284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

首页上一页