• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 64
  • 27
  • 23
  • 13
  • 11
  • 7
  • 6
  • 5
  • 4
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 206
  • 27
  • 26
  • 22
  • 17
  • 16
  • 16
  • 15
  • 14
  • 14
  • 14
  • 11
  • 11
  • 11
  • 10
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Effect of stitch length and type of thread on the strength of seams in wool and wool-like fabrics

Kyle, Connie Rogene January 2011 (has links)
Digitized by Kansas State University Libraries
2

The golden thread

Sutton, Jordan Thomas 24 September 2012 (has links)
The beauty of the natural environment surrounding the town of Golden is subtly miraculous. Surrounded by national and provincial parks the town of Golden exists as a setting for rest and replenishment. The surrounding rugged landscapes, prized for their harsh beauties meets here at Golden with the calm serenity of the Columbia Valley. Along a network of elements threading the town’s existence, the industrious settlement of Golden has become a strategic setting for transportations of goods on rail and road across Canada. The industrious town of Golden today faces challenges between economic and environmental struggles. Golden’s struggle is not unlike many other towns in the mountain west, embracing tourism and growth effectively without damaging the attractive spirit of the town and industrial heritage. This practicum presents the Golden Thread as a balance between the present state of Golden and the future of this community with an exposed respect for environmental and cultural heritage. The ultimate purpose for the Golden Thread is to weave the town of Golden together by fostering a respect for all of what makes Golden extraordinary.
3

The golden thread

Sutton, Jordan Thomas 24 September 2012 (has links)
The beauty of the natural environment surrounding the town of Golden is subtly miraculous. Surrounded by national and provincial parks the town of Golden exists as a setting for rest and replenishment. The surrounding rugged landscapes, prized for their harsh beauties meets here at Golden with the calm serenity of the Columbia Valley. Along a network of elements threading the town’s existence, the industrious settlement of Golden has become a strategic setting for transportations of goods on rail and road across Canada. The industrious town of Golden today faces challenges between economic and environmental struggles. Golden’s struggle is not unlike many other towns in the mountain west, embracing tourism and growth effectively without damaging the attractive spirit of the town and industrial heritage. This practicum presents the Golden Thread as a balance between the present state of Golden and the future of this community with an exposed respect for environmental and cultural heritage. The ultimate purpose for the Golden Thread is to weave the town of Golden together by fostering a respect for all of what makes Golden extraordinary.
4

Development of a resin treated cotton thread for the durable press process

Ferguson, Carmen Willard 12 1900 (has links)
No description available.
5

Exploiting Malleable Parallelism on Multicore Systems

McFarland, Daniel James 29 July 2011 (has links)
As shared memory platforms continue to grow in core counts, the need for context-aware scheduling continues to grow. Context-aware scheduling takes into account characteristics of the system and application performance when making decisions. Traditionally applications run on a static thread count that is set at compile-time or at job start time, without taking into account the dynamic context of the system, other running applications, and potentially the performance of the application itself. However, many shared memory applications can easily be converted to malleable applications, that is, applications that can run with an arbitrary number of threads and can change thread counts during execution. Many new and intelligent scheduling decisions can be made when applications become context-aware, including expanding to ll an empty system or shrinking to accommodate a more parallelizable job. This thesis describes a prototype system called Resizing for Shared Memory (RSM), which supports OpenMP applications on shared memory platforms. RSM includes a main daemon that records performance information and makes resizing decisions as well as a communication library to allow applications to contact the RSM daemon and enact resizing decisions. Experimental results show that RSM can improve turn-around time and system utilization even using very simple heuristics and resizing policies. / Master of Science
6

3d terrain visualization and CPU parallelization of particle swarm optimization

Wieczorek, Calvin L. January 2018 (has links)
Indiana University-Purdue University Indianapolis (IUPUI) / Particle Swarm Optimization is a bio-inspired optimization technique used to approximately solve the non-deterministic polynomial (NP) problem of asset allocation in 3D space, frequency, antenna azimuth [1], and elevation orientation [1]. This research uses QT Data Visualization to display the PSO solutions, assets, transmitters in 3D space from the work done in [2]. Elevation and Imagery data was extracted from ARCGIS (a geographic information system (GIS) database) to add overlapping elevation and imagery data to that the 3D visualization displays proper topological data. The 3D environment range was improved and is now dynamic; giving the user appropriate coordinates based from the ARCGIS latitude and longitude ranges. The second part of the research improves the performance of the PSOs runtime, using OpenMP with CPU threading to parallelize the evaluation of the PSO by particle. Lastly, this implementation uses CPU multithreading with 4 threads to improve the performance of the PSO by 42% - 51% in comparison to running the PSO without CPU multithreading. The contributions provided allow for the PSO project to be more realistically simulate its use in the Electronic Warfare (EW) space, adding additional CPU multithreading implementation for further performance improvements.
7

An Exploration of On-chip Network-based Thread Migration

Matthew, Misler 12 January 2011 (has links)
As the number of cores integrated on a single chip continues to increase, communication has the potential to become a severe bottleneck to overall system performance. The presence of thread sharing and the distribution of data across cache banks on the chip can result in long distance communication. Long distance communication incurs substantial latency that impacts performance; furthermore, this communication consumes significant dynamic power when packets are switched over many Network-on-Chip (NoC) links and routers. Thread migration can mitigate problems created by long distance communication. This thesis presents Moths, which stands for Mobile Threads. Moths is an efficient run-time algorithm that responds automatically to dynamic NoC traffic patterns, providing beneficial thread migration to decrease overall traffic volume and average packet latency. Moths reduces latency by up to 28.4% (18.0% on average) and traffic volume by up to 24.9% (20.6% on average) across a variety of commercial and scientific benchmarks.
8

An Exploration of On-chip Network-based Thread Migration

Matthew, Misler 12 January 2011 (has links)
As the number of cores integrated on a single chip continues to increase, communication has the potential to become a severe bottleneck to overall system performance. The presence of thread sharing and the distribution of data across cache banks on the chip can result in long distance communication. Long distance communication incurs substantial latency that impacts performance; furthermore, this communication consumes significant dynamic power when packets are switched over many Network-on-Chip (NoC) links and routers. Thread migration can mitigate problems created by long distance communication. This thesis presents Moths, which stands for Mobile Threads. Moths is an efficient run-time algorithm that responds automatically to dynamic NoC traffic patterns, providing beneficial thread migration to decrease overall traffic volume and average packet latency. Moths reduces latency by up to 28.4% (18.0% on average) and traffic volume by up to 24.9% (20.6% on average) across a variety of commercial and scientific benchmarks.
9

Design and Implementation of C Programming Language Extension for Parallel GPU Computing

Yang, Yu-Wei 27 July 2010 (has links)
NVIDIA developed a technique of executing general program on GPU, named CUDA (Compute Unified Device Architecture), in 2006. The CUDA programming model allows a group of same instructions to execute on multi-thread simultaneously, which has advantage of parallel programs in reducing the execution time significantly. Although CUDA provides a series of C-like APIs (Application Programming Interface) so that programmers can easy use CUDA language, it still costs certain efforts to be familiar with the development. In this thesis, we propose a tool to automatically translate C programs into corresponding CUDA programs which reduce program development time effectively.
10

Design and Implementation of Thread-Level Speculation in JavaScript Engines

Martinsen, Jan Kasper January 2014 (has links)
Two important trends in computer systems are that applications are moved to the Internet as web applications, and that computer systems are getting an increasing number of cores to increase the performance. It has been shown that JavaScript in web applications has a large potential for parallel execution despite the fact that JavaScript is a sequential language. In this thesis, we show that JavaScript execution in web applications and in benchmarks are fundamentally different and that an effect of this is that Just-in-time compilation does often not improve the execution time, but rather increases the execution time for JavaScript in web applications. Since there is a significant potential for parallel computation in JavaScript for web applications, we show that Thread-Level Speculation can be used to take advantage of this in a manner completely transparent to the programmer. The Thread-Level Speculation technique is very suitable for improving the performance of JavaScript execution in web applications; however we observe that the memory overhead can be substantial. Therefore, we propose several techniques for adaptive speculation as well as for memory reduction. In the last part of this thesis we show that Just-in-time compilation and Thread-Level Speculation are complementary techniques. The execution characteristics of JavaScript in web applications are very suitable for combining Just-in-time compilation and Thread-Level Speculation. Finally, we show that Thread-Level Speculation and Just-in-time compilation can be combined to reduce power usage on embedded devices.

Page generated in 0.0339 seconds