Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04)最新文献

筛选
英文 中文
A New Memory Module for COTS-Based Personal Supercomputing 一种新的基于cots的个人超级计算内存模块
N. Tanabe, M. Nakatake, H. Hakozaki, Y. Dohi, H. Nakajo, H. Amano
{"title":"A New Memory Module for COTS-Based Personal Supercomputing","authors":"N. Tanabe, M. Nakatake, H. Hakozaki, Y. Dohi, H. Nakajo, H. Amano","doi":"10.1109/IWIA.2004.10019","DOIUrl":"https://doi.org/10.1109/IWIA.2004.10019","url":null,"abstract":"This paper presents how to make inexpensive personal supercomputers getting the merit of commercial-off-the-shelf (COTS) continuously after the death of vector super-computer venders. It is designed to realize this goal without any modification on CPU, bridge chips on motherboard and memory chips. Only plugging a new memory module with vector load/store function make an inexpensive home-use personal computer into a node similar to Earth simulator's one. These nodes can be connected by COTS Infiniband 4X type or 12X type switches in order to make parallel systems. COTS SO-DIMMs on the memory modules can be accessed fastly by remote nodes by using AOTF, BOTF, RDMA and remote vector load / store operations. Applications with unit striding or indexed accesses are going to be accelerated. How to accelerate NAS CG class B is shown as an example. Used evaluation methodlogy is about 500 times faster than that of SimpleScalar based methodology. It is predicted with bandwidth analysis that up to 8.75 times improvement can be achieved by proposed system for a single CPU Pentium4 PC without parallel processing","PeriodicalId":309704,"journal":{"name":"Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04)","volume":"38 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114107483","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}
引用次数: 12
Array Data Dependence Testing with the Chains of Recurrences Algebra 用递归代数链检验数组数据相关性
Robert A. van Engelen, Johnnie Birch, K. Gallivan
{"title":"Array Data Dependence Testing with the Chains of Recurrences Algebra","authors":"Robert A. van Engelen, Johnnie Birch, K. Gallivan","doi":"10.1109/IWIA.2004.10018","DOIUrl":"https://doi.org/10.1109/IWIA.2004.10018","url":null,"abstract":"This paper presents a new approach to dependence testing in the presence of nonlinear and non-closed array index expressions and pointer references. The chains of recurrences formalism and algebra is used to analyze the recurrence relations of induction variables, and for constructing recurrence forms of array index expressions and pointer references. We use these recurrence forms to determine if the array and pointer references are free of dependences in a loop nest. Our recurrence formulation enhances the accuracy of standard dependence algorithms such as the extreme value test and range test. Because the recurrence forms are easily converted to closed forms (when they exist), induction variable substitution and array recovery can be delayed until after the loop is analyzed","PeriodicalId":309704,"journal":{"name":"Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116943360","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}
引用次数: 13
Of Piglets and Threadlets: Architectures for Self-Contained, Mobile, Memory Programming 仔猪和线程:自包含的,移动的,内存编程的架构
P. Kogge
{"title":"Of Piglets and Threadlets: Architectures for Self-Contained, Mobile, Memory Programming","authors":"P. Kogge","doi":"10.1109/IWIA.2004.10005","DOIUrl":"https://doi.org/10.1109/IWIA.2004.10005","url":null,"abstract":"Virtually all of the discussion on \"commodity\" vs. \"custom\" architectures, especially for highly parallel systems, has focused on the high-glamor, high complexity processor core. This paper takes a different tack - it explores the potential for directly attacking the memory wall by programming the classically \"dumb\" memory interface. Several related but separable techniques are involved: converting the data that makes up a memory request into the machine state of a \"traveling thread\", and developing an ISA that can manipulate this state via extremely short instructions that allow complete programs to be stored within the access packet. The results are interesting: a wide spectrum of functions applications exist for which this approach provides significant improvement in bandwidth and latency","PeriodicalId":309704,"journal":{"name":"Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116871769","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}
引用次数: 21
Parallel Processing using Data Localization for MPEG2 Encoding on OSCAR Chip Multiprocessor OSCAR芯片多处理器上基于数据定位的MPEG2编码并行处理
T. Kodaka, Hirohumi Nakano, K. Kimura, H. Kasahara
{"title":"Parallel Processing using Data Localization for MPEG2 Encoding on OSCAR Chip Multiprocessor","authors":"T. Kodaka, Hirohumi Nakano, K. Kimura, H. Kasahara","doi":"10.1109/IWIA.2004.10021","DOIUrl":"https://doi.org/10.1109/IWIA.2004.10021","url":null,"abstract":"Currently, many people are enjoying multimedia applications with image and audio processing on PCs, PDAs, mobile phones and so on. With the popularization of the multimedia applications, needs for low cost, low power consumption and high performance processors has been increasing. To this end, chip multiprocessor architectures which allow us to attain scalable performance improvement by using multigrain parallelism are attracting much attention. However, in order to extract higher performance on a chip multiprocessor, more sophisticated software techniques are required, such as decomposing a program into adequate grain of tasks, assigning them onto processors considering parallelism, data locality optimization and so on. This paper describes a parallel processing scheme for MPEG2 encoding using data localization which improve execution efficiency assigning coarse grain tasks sharing same data on a same processor consecutively for a chip multiprocessor. The performance evaluation on OSCAR chip multiprocessor architecture shows that proposed scheme gives us 6.97 times speedup using 8 processors and 10.93 times speedup using 16 processors against sequential execution time respectively. Moreover, the proposed scheme gives us 1.61 times speedup using 8 processors and 2.08 times speedup using 16 processors against loop parallel processing which has been widely used for multiprocessor systems using the same number of processors","PeriodicalId":309704,"journal":{"name":"Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114370627","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}
引用次数: 7
Memory Management for Data Localization on OSCAR Chip Multiprocessor OSCAR芯片多处理器数据定位的内存管理
H. Nakano, T. Kodaka, K. Kimura, H. Kasahara
{"title":"Memory Management for Data Localization on OSCAR Chip Multiprocessor","authors":"H. Nakano, T. Kodaka, K. Kimura, H. Kasahara","doi":"10.1109/IWIA.2004.10020","DOIUrl":"https://doi.org/10.1109/IWIA.2004.10020","url":null,"abstract":"Chip multiprocessor (CMP) architecture has attracting much attention as a next-generation microprocessor architecture and many kinds of CMP are widely being researched. However, CMP architectures several difficulties for effective use of memory, especially cache or local memory near a processor core. The authors have proposed OSCAR CMP architecture, which cooperatively works with multigrain parallelizing compiler which gives us much higher parallelism than instruction level parallelism or loop level parallelism and high productivity of application programs. To support the compiler optimization for effective use of cache or local memory, OSCAR CMP has local data memory (LDM) for processor private data and distributed shared memory (DSM) for synchronization and fine grain data transfers among processors, in addition to centralized shared memory (CSM) to support dynamic task scheduling. This paper proposes a static coarse grain task scheduling scheme for data localization using live variable analysis. Furthermore, remote memory data transfer scheduling scheme using information of live variable analysis is also described. The proposed scheme is implemented on OSCAR FORTRAN multigrain parallelizing compiler and is evaluated on OSCAR CMP using Tomcatv and Swim in SPEC CFP 95 benchmark","PeriodicalId":309704,"journal":{"name":"Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128848163","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}
引用次数: 4
Custom-Enabled System Architectures for High End Computing 高端计算的自定义系统架构
T. Sterling, P. Kogge
{"title":"Custom-Enabled System Architectures for High End Computing","authors":"T. Sterling, P. Kogge","doi":"10.1109/IWIA.2004.10014","DOIUrl":"https://doi.org/10.1109/IWIA.2004.10014","url":null,"abstract":"The US Federal Government has convened a major committee to determine future directions for government sponsored high end computing system acquisitions and enabling research. The High End Computing Revitalization Task Force was inaugurated in 2003 involving all Federal agencies for which high end computing is critical to meeting mission goals. As part of the HECRTF agenda, a multi-day community wide workshop was conducted involving experts from academia, industry, and the national laboratories and centers to provide the broadest perspective on important issues related to the HECRTF purview. Among the most critical issues in establishing future directions is the relative merits of commodity based systems such as clusters and MPPs versus custom system architecture strategies. This paper presents a perspective on the importance and value of the custom architecture approach in meeting future US requirements in supercomputing. The contents of this paper reflect the ideas of the participants of the working group chartered to explore custom enabled system architectures for high end computing. As in any such consensus presentation, while this paper captures the key ideas and tradeoffs, it does not exactly match the viewpoint of any single contributor, and there remains much room for constructive disagreement and refinement of the essential conclusions","PeriodicalId":309704,"journal":{"name":"Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130993765","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
Direct Instruction Wakeup for Out-of-Order Processors 无序处理器的直接指令唤醒
M. A. Ramírez, A. Cristal, A. Veidenbaum, L. Villa, M. Valero
{"title":"Direct Instruction Wakeup for Out-of-Order Processors","authors":"M. A. Ramírez, A. Cristal, A. Veidenbaum, L. Villa, M. Valero","doi":"10.1109/IWIA.2004.10002","DOIUrl":"https://doi.org/10.1109/IWIA.2004.10002","url":null,"abstract":"Instruction queues consume a significant amount of power in high-performance processors, primarily due to instruction wakeup logic access to the queue structures. The wakeup logic delay is also a critical timing parameter. This paper proposes a new queue organization using a small number of successor pointers plus a small number of dynamically allocated full successor bit vectors for cases with a larger number of successors. The details of the new organization are described and it is shown to achieve the performance of CAM-based or full dependency matrix organizations using just one pointer per instruction plus eight full bit vectors. Only two full bit vectors are needed when two successor pointers are stored per instruction. Finally, a design and pre-layout of all critical structures in 70 nm technology was performed for the proposed organization as well as for a CAM-based baseline. The new design is shown to use 1/2 to 1/5th of the baseline instruction queue power, depending on queue size. It is also shown to use significantly less power than the full dependency matrix based design","PeriodicalId":309704,"journal":{"name":"Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04)","volume":"348 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130944662","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}
引用次数: 16
Fault-Tolerant Adaptive Deadlock-Recovery Routing for k-ary n-cube Networks k元n立方网络的容错自适应死锁恢复路由
T. Yoshinaga, H. Hosogoshi, M. Sowa
{"title":"Fault-Tolerant Adaptive Deadlock-Recovery Routing for k-ary n-cube Networks","authors":"T. Yoshinaga, H. Hosogoshi, M. Sowa","doi":"10.1109/IWIA.2004.10016","DOIUrl":"https://doi.org/10.1109/IWIA.2004.10016","url":null,"abstract":"This paper proposes a fault-tolerant fully adaptive deadlock-recovery routing algorithm for k-ary n-cube networks. We intend to consider both the adaptability for faults and the communication performance by integrating regular and irregular network routing. Our algorithm tolerates any number or shape of faults without disabling fault-free nodes by maintaining routing tables that are configured based on faulty information. Our algorithm also provides minimal misrouting paths around faults by guaranteeing deadlock freedom using only two virtual channels per physical channel. Simulation results show that the proposed algorithm attains robust communication performance for uniform and nonuniform traffic patterns not only on a fault-free torus network but also on irregular tori with faulty nodes","PeriodicalId":309704,"journal":{"name":"Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127927624","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}
引用次数: 5
YAWARA: A Meta-Level Optimizing Computer System YAWARA:一个元级优化计算机系统
T. Baba, T. Yokota, K. Ootsu, F. Furukawa, G. Ishihara, M. Saito
{"title":"YAWARA: A Meta-Level Optimizing Computer System","authors":"T. Baba, T. Yokota, K. Ootsu, F. Furukawa, G. Ishihara, M. Saito","doi":"10.1109/IWIA.2004.10007","DOIUrl":"https://doi.org/10.1109/IWIA.2004.10007","url":null,"abstract":"This paper proposes a new, autonomous and dynamic optimization framework, called a meta-level computation. In this framework, a meta-level processor acquires the execution profile of a base-level processor, i.e. a conventional von Neumann machine, produces the optimized base-level configuration and performs the reconfiguration. We define the meta-level computation model based on the considerations of hardware versus software reconfiguration, static versus dynamic reconfiguration and homogeneous versus heterogeneous architecture. The model employs a thread-level reconfiguration to realize the autonomous and dynamic optimization on a uniformly structured multiprocessor. As an implementation of the computation model, we propose a software/hardware combined system, called the YAWARA system. The software system realizes both static and dynamic feedback-directed, autonomous optimization. The hardware system consists of thread engines, each of which includes hardware mechanisms for profiling and feedback-directed resource control","PeriodicalId":309704,"journal":{"name":"Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122393065","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}
引用次数: 2
Implementation Details and Evaluation of a New Exact and Fast Test for Array Data Dependence Analysis Based on Simplex Method 一种新的基于单纯形法的阵列数据依赖分析精确快速测试方法的实现细节与评价
M. Mineo, S. Saito, T. Uehara, Y. Kunieda
{"title":"Implementation Details and Evaluation of a New Exact and Fast Test for Array Data Dependence Analysis Based on Simplex Method","authors":"M. Mineo, S. Saito, T. Uehara, Y. Kunieda","doi":"10.1109/IWIA.2004.10013","DOIUrl":"https://doi.org/10.1109/IWIA.2004.10013","url":null,"abstract":"Data dependence analysis (DDA) is essential for any automatic parallelizing compiler to determine parallelizability of given portions of programs. Several techniques and tests to analyze data dependence between array elements have already been proposed. It is clear that when one examines these conventional DDA techniques, there exists a trade-off between their analysis speed and exactness of their analysis result. When the exactness of DDA is of primary importance, one can usually select the Omega test among the conventional tests. However, the Omega test analyses several ten times slower than the Banerjee test, on average. Moreover, it is hard to implement the Omega test. Therefore, in this paper a new exact test is proposed, whose algorithm is so simple that the analysis speed is generally several times faster than the Omega test. This new algorithm is mainly constructed by combining the Simplex method for linear programming with an exhaustive solution search. To evaluate this new algorithm, 55 benchmark programs were created. The comparison with the Omega test using these benchmark programs is also described","PeriodicalId":309704,"journal":{"name":"Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'04)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115785612","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书