Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 12 of 12 for “"Task parallelism"”.
-
Combining Task Parallelism and Multithreaded Concurrency
… threads and the OpenCilk runtime for enabling task parallelism within multiple concurrent threads. With Multicilk, a programmer can parallelize threads in a multithreaded application simply by using Cilk independently within each thread. Without Multicilk, doing so violates the semantics that …
-
Puppetmaster: a certified hardware architecture for task parallelism
This thesis presents Puppetmaster, a hardware accelerator for transactional workloads. Existing software and hardware frameworks for transactional memory and online transaction processing are not able to scale to hundreds or thousands of cores unless the rate of conflicts between transactions is …
-
A Task-based Programming Methodology Using MCA Standards for Multicore Systems
… difficult due to the system’s heterogeneity. Task parallelism is a classic approach to schedule work in parallel at the application level for symmetric or even asymmetric multicore processors (that may be heterogeneous in nature). A robust and efficient task-programming model to tackle …
-
Design and Implementation of a Nonblocking Randomized Work Stealing Scheduler
… system. In addition to enabling fork-join task parallelism, FLCN supports other Cilk features such as reducer hyperobjects. Through analyzing the performance of FLCN on various canonical benchmark programs, I find that for programs with low amounts of work, FLCN performs worse than the …
-
Highly parallelized control programming methodologies using multicore CPU and FPGA for highly dynamic multi-DoF mobile robots, applied to the MIT Cheetah
… architecture is programmed. Inspired by data parallelism, task parallelism, and the pipelining method, more than 50 processes are operated in parallel, and major processes among them are optimized to achieve the maximum throughput.The proposed methodologies enable the high-level control …
-
Simultaneous exploitation of task and data parallelism in regular scientific applications
… applications--the simultaneous exploitation of task and data parallelism. Our optimization is implemented as part of the PARADIGM HPF compiler framework and as part of a MATLAB compiler framework we have developed. The intuitive idea behind the optimization is the use of task parallelism to …
-
Practical analyses and transformations for flow-based parallelism
… Traditional parallel abstractions such as data parallelism and task parallelism, while necessary, do not fully address the needs of today's multi-threaded commercial applications. Emerging applications in the domains of recognition, mining and synthesis (RMS); image and video processing; data …
-
Fast and generic concurrent message-passing
… and of programming models with dynamic task parallelism, assuming a large number of concurrent, light-weight threads. These applications come from important classes of applications such as graph and data analytics. Using MPI with these languages/runtimes is inefficient because MPI …
-
Global EDF Scheduling for Parallel Real-Time Tasks
… real-time programs to take advantage of intra-task parallelism in order to support computation-intensive applications with tight deadlines. In this thesis, we consider the Global Earliest Deadline First (GEDF) scheduling policy for task sets consisting of parallel tasks. Each task can be …
-
Composable abstractions for synchronization in dynamic threading platforms
… each component itself may be designed to exploit parallelism. This dissertation presents the design of three composable abstractions for synchronization in dynamic-threading platforms, based on ideas of task-graph execution, helper locks, and transactional memory. These designs demonstrate …
-
FPGA-based programmable embedded platform for image processing applications
… over sin- gle core IPPro by exploiting data parallelism. The pipelined execution of multiple stages revealed that a dataflow graph can be decomposed into balanced actors to deliver maximum performance by hiding data transfer and processing time through exploiting task parallelism; otherwise, …
-
Improving programmability and performance for scientific applications
… models which decouple algorithmic complexity, parallelism concerns, and hardware mapping. We build upon these frameworks to exploit domain-specific semantics using high-level transformations and modifications to obtain performance through algorithmic and runtime optimizations.</p> <p>We first …