GPGPU编程技术初探

伴随着GPGPU计算技术的不断发展,HPC高性能计算系统体系结构正在悄然发生着一场变革,这场变革为高性能计算发展提供了一个新的方向、CUDA是NIVIDIA公司提供的利用GPGPU进行并行运算应用开发的一套C语言编程平台,通过它可以利用特定显卡的高性能运算能力进行一些大规模高性能计算,有效提升计算机系统的使用效率,本文主要介绍GPU发展现状以及如何利用CUDA编程技术进行并行运算软件开发．     

The Impact of Speculative Execution on SMT Processors

By executing two or more threads concurrently, Simultaneous MultiThreading (SMT) architectures are able to exploit both Instruction-Level Parallelism (ILP) and Thread-Level Parallelism (TLP) from the increased number of in-flight instructions that are fetched from multiple threads. However, due to incorrect control speculations, a significant number of these in-flight instructions are discarded from the pipelines of SMT processors (which is a direct consequence of these pipelines getting wider and deeper). Although increasing the accuracy of branch predictors may reduce the number of instructions so discarded from the pipelines, the prediction accuracy cannot be easily scaled up since aggressive branch prediction schemes strongly depend on the particular predictability inherently to the application programs. In this paper, we present an efficient thread scheduling mechanism for SMT processors, called SAFE-T (Speculation-Aware Front-End Throttling): it is easy to implement and allows an SMT processor to selectively perform speculative execution of threads according to the confidence level on branch predictions, hence preventing wrong-path instructions from being fetched. SAFE-T provides an average reduction of 57.9% in the number of discarded instructions and improves the instructions per cycle (IPC) performance by 14.7% on average over the ICOUNT policy across the multi-programmed workloads we simulate. This paper is an extended version of the paper, “Speculation Control for Simultaneous Multithreading,” which appeared in the Proceedings of the 18th International Parallel and Distributed Processing Symposium, Santa Fe, New Mexico, April 2004.     

OpenLDAP性能测试分析与优化

OpenLDAP是开源的LDAP服务器,在分布式目录服务中得到了广泛应用.详细分析了OpenLDAP目前所采用的独特"线程池"模式.通过比较OpenLDAP在不同模式下的性能差异,发现原模式对LDAP操作存在较大的响应延迟.进一步给出了改进的"线程池"模式,该改进模式能够降低LDAP操作响应延迟.最后通过仿真实验,表明改进模式可以明显改善OpenLDAP的性能.     

证券行情库实时传送系统的研究

在分析了证券行情库结构的基础上,详细介绍了开发证券行情库实时传送系统的过程.     

GPU平台上面向性能和功耗的分支优化

强大的计算能力使得GPGPU在通用计算领域得到了广泛的应用。然而,GPGPU的SIMT(Single Instruction Multiple Threads)工作方式,使其执行效率受到应用中不一致分支行为(Branch Divergence)的严重影响。虽然人们提出了线程交换方法来减小分支带来的性能损失,但这种方法往往会引入额外的访存操作,不仅在一定程度上减少了线程交换优化的性能收益,还增加了功耗。首先举例说明线程交换范围对程序性能和功耗的影响;然后提出了一种减少线程交换所引入的额外访存操作的方法。实验表明,对于Reduction程序,当交换范围为256时,在性能平均损失为4%的情况下功耗降低幅度最大为7%;而对于Bitonic程序,当交换范围为256和512时,在没有功耗开销的情况下,性能分别最大提升了6.4%和5.3%。     

基于Windows95的可视电话软件系统中多线程设计策略

介绍了 Windows95操作系统中占先式多任务的概念和管理机制 ,重点讨论了在可视电话软件系统中多线程优先级的设置对系统性能的影响及优化策略     

基于Windows NT的小型交互式语音应答系统的设计策略

本文讨论了在基于低端服务器上的语音应答系统中,如何平滑处理多个呼叫并发以优化系统响应的线程结构设计及调度策略。     

NT服务程序设计

本文介绍与 ＮＴ服务相关的部件以及服务程序的架构,指出需要注意的问题,并给出了 示例程序。     

MODIFICATION OF GEOMETRY AND TECHNOLOGY OF CYLINDRICAL WORMS

The objective of this research is to develop a new method of grinding process that can efficiently make concave profile of the worm thread smooth. The grinding is carried out using a wheel with curvature profile in the axial plane in the form of an arc of logarithmic spiral. The proposed method will provide maximum line of contact between the tool and the worm with minimum stress concentration at any point. The generating equation of the grinding tool profile and its arrangement with respect to the worm during thread grinding were determined.     

Thread vulnerability in parallel applications

Continuously reducing transistor sizes and aggressive low power operating modes employed by modern architectures tend to increase transient error rates. Concurrently, multicore machines are dominating the architectural spectrum today in various application domains. These two trends require a fresh look at resiliency of multithreaded applications against transient errors from a software perspective. In this paper, we propose and evaluate a new metric called the Thread Vulnerability Factor (TVF$TVF$). A distinguishing characteristic of TVF$TVF$ is that its calculation for a given thread (which is typically one of the threads of a multithreaded application) does not depend on its code alone, but also on the codes of the threads that share resources and data with that thread. As a result, we decompose TVF$TVF$ of a thread into two complementary parts: local and remote. While the former captures the TVF$TVF$ induced by the code of the target thread, the latter represents the vulnerability impact of the threads that interact with the target thread. We quantify the local and remote TVF$TVF$ values for three architectural components (register file, ALUs, and caches) using a set of ten multithreaded applications from the Parsec and Splash-2 benchmark suites. Our experimental evaluation shows that TVF$TVF$ values tend to increase as the number of cores increases, which means the system becomes more vulnerable as the core count rises. We further discuss how TVF$TVF$ metric can be employed to explore performance–reliability tradeoffs in multicores. Reliability-based analysis of compiler optimizations and redundancy-based fault tolerance are also mentioned as potential usages of our TVF$TVF$ metric.