- / -

No description available.

In the theoretical part of this thesis are described types of threads, methods of production and control of threads, types of taps, types of coatings and cutting fluids, analysis of specific cutting forces during thread cutting and theoretical analysis of the cross-section distribution by taps using. The experimental part of this thesis includes the production of internal threads by cutting tap at constant cutting conditions. The cutting time was measured according to the function of time during the experiment. The measured data were statistically processed and, as a result, the cost of one thread production was calculated.

This thesis deals with the study of production process of threads by screw-taps from the very description of the individual threads through all the available methods of the threads production, thread control function, up to the actual taps, materials, coatings and their distribution. In the experimental part the thesis deals with the question whether it is possible to find an alternative to the standard production of threads using cutting by taps. This alternative seems to be the use of forming taps. The experiment took place under constant cutting conditions and consisted of two parts, one of them was the production of threads into the pre-drilled through holes and the second one was the production of threads into the pre-drilled impassable holes. The result of the experiment was finding the course of the cutting moment depending on the time and the amount of wear of the examined kinds of taps when all the measured values had to be statistically processed and conclusions were then evaluated.

This thesis deals with the study of production process of threads by screw-taps from the very description of the individual threads through all the available methods of the threads production, thread control function, up to the actual taps, materials, coatings and their distribution. In the experimental part the thesis deals with the question whether it is possible to find an alternative to the standard production of threads using cutting by taps. This alternative seems to be the use of forming taps. The experiment took place under constant cutting conditions and consisted of two parts, one of them was the production of threads into the pre-drilled through holes and the second one was the production of threads into the pre-drilled impassable holes. The result of the experiment was finding the course of the cutting moment depending on the time and the amount of wear of the examined kinds of taps when all the measured values had to be statistically processed and conclusions were then evaluated.

International Telemetering Conference Proceedings / October 30-November 02, 1995 / Riviera Hotel, Las Vegas, Nevada / Object Oriented techniques have been successfully applied to all phases of software development including Requirements Analysis, Design, and Implementation. There has been some reluctance to extend the Object paradigm into the System Analysis, Architecture Development, and System Design phases. This is due to reasons generally related to technology immaturity and concerns with applicability. Telemetry systems in particular appear to be somewhat slow in embracing object technology. The Range Standardization and Automation program has integrated proven techniques to successfully produce an Object-oriented Systems Model. This paper presents the techniques and benefits.

As the design of computers advances, two important trends have surfaced: The exploitation of parallelism and the design against memory latency. Into these two new trends has come the Multithreaded Virtual Processor (MVP). Based on a standard superscalar core, the MVP is able to exploit both Instruction Level Parallelism (ILP) and, utilizing the concepts of multithreading, is able to further exploit Thread Level Parallelism (TLP) in program code. By combining both hardware and software multithreading techniques into a new hybrid model, the MVP is able to use fast hardware context switching techniques along with both hardware and software scheduling. The new hybrid creates a processor capable of exploiting long memory latency operations to increase parallelism, while introducing both minimal software overhead and hardware design changes. This thesis will explore the MVP model and simulator and provide results that illustrate MVP's effectiveness and demonstrate its recommendation to be included in future processor designs. Additionally, the thesis will show that MVP's effectiveness is governed by four main considerations: (1) The data set size relative to the cache size, (2) the number of hardware contexts/threads supported, (3) the amount of locality within the data sets, and (4) the amount of exploitable parallelism within the algorithms. / Graduation date: 1999

Thesis (M.S.)--University of Delaware, 2006. / Principal faculty advisor: Guang R. Gao, Dept. of Electrical and Computer Engineering. Includes bibliographical references.

Thèse doctorat : Informatique : Rennes 1 : 2007. / Bibliogr. p. 183-187.

General-Purpose computing on Graphics Processing Units (GPGPU) has attracted a lot of attention recently. Exciting results have been reported in using GPUs to accelerate applications in various domains such as scientific simulations, data mining, bio-informatics and computational finance. However, up to now GPUs can only accelerate data-parallel loops with statically analyzable parallelism. Loops with dynamic parallelism (e.g., with array accesses through subscripted subscripts), an important pattern in many general-purpose applications, cannot be parallelized on GPUs using existing technologies. Run-time loop parallelization using Thread Level Speculation (TLS) has been proposed in the literatures to parallelize loops with statically un-analyzable dependencies. However, most of the existing TLS systems are designed for multiprocessor/multi-core CPUs. GPUs have fundamental differences with CPUs in both hardware architecture and execution model, making the previous TLS designs not work or inefficient when ported to GPUs. This thesis presents GPUTLS, a runtime system designed to support speculative loop parallelization on GPUs. The design of GPU-TLS addresses several key problems encountered when adapting TLS to GPUs: (1) To reduce the possibility of mis-speculation, deferred-update memory versioning scheme is adopted to avoid mis-speculations caused by inter-iteration WAR and WAW dependencies. A technique named intra-warp value forwarding is proposed to respect some inter-iteration RAW dependencies, which further reduces the mis-speculation possibility. (2) An incremental speculative execution scheme is designed to exploit partial parallelism within loops. This avoids excessive re-executions and reduces the mis-speculation penalty. (3) The dependency checking among thousands of speculative GPU threads poses large overhead and can easily become the performance bottleneck. To lower the overhead, we design several e_cient dependency checking schemes named PRW+BDC, SW, SR, SRW+EDC, and SRW+LDC respectively. (4) We devise a novel parallel commit scheme to avoid the overhead incurred by the serial commit phase in most existing TLS designs. We have carried out extensive experiments on two platforms with different NVIDIA GPUs, using both a synthetic loop that can simulate loops with different characteristics and several loops from real-life applications. Testing results show that the proposed intra-warp value forwarding and eager dependency checking techniques can improve the performance for almost all kinds of loop patterns. We observe that compared with other dependency checking schemes, SR and SW can achieve better performance in most cases. It is also shown that the proposed parallel commit scheme is especially useful for loops with large write set size and small number of inter-iteration WAW dependencies. Overall, GPU-TLS can achieve speedups ranging from 5 to 105 for loops with dynamic parallelism. / published_or_final_version / Computer Science / Master / Master of Philosophy