Multithreaded programming on the GPU

2017 ◽  
Author(s):  
Marc Moreno Maza
Keyword(s):  
Multithreaded Programming

Multithreaded Programming of Reconfigurable Embedded Systems

2011 ◽  
pp. 31-54
Author(s):  
Jason Agron ◽  
David Andrews ◽  
Markus Happe ◽  
Enno Lübbers ◽  
Marco Platzner
Keyword(s):  
Development Time ◽  
Programming Model ◽  
General Purpose ◽  
System Level ◽  
Performance Ratio ◽  
Multithreaded Programming ◽  
Price Performance ◽  
Flexible Hardware ◽  
Custom Hardware ◽  
Application Requirements

Embedded and Real-Time (ERTS) systems have continued to expand at a vigorous rate. Designers of ERTS systems are continually challenged to provide new capabilities that can meet the expanding requirements and increased computational needs of each new proposed application, but at a decreasing price/performance ratio. Conventional solutions using general purpose processors or custom ASICs are less and less able to satisfy the contradictory requirements in performance, flexibility, power, development time, and cost. This chapter introduces the concept of generating semi-custom platforms driven from a traditional multithreaded programming model. This approach offers the advantage of achieving productivity levels close to those associated with software by using an established programming model but with a performance level close to custom hardware through the use of a flexible hardware platform capable of adapting to specialized application requirements. We discuss the underlying concepts, requirements and advantages of multithreading in the context of reconfigurable hardware, and present two approaches which provide multithreading support to hardware and software components at the operating system level.

A VxD-based automatic blending system using multithreaded programming

2004 ◽  
Vol 43 (1) ◽  
pp. 99-109 ◽  
Author(s):  
L. Wang ◽  
X. Jiang ◽  
Y. Chen ◽  
K.C. Tan
Keyword(s):  
Multithreaded Programming

ALIGNED MULTITHREADED COMPUTATIONS AND THEIR SCHEDULING WITH PERFORMANCE GUARANTEES

2003 ◽  
Vol 13 (03) ◽  
pp. 353-364 ◽  
Author(s):  
XIE YONG ◽  
HSU WEN-JING
Keyword(s):  
Computational Model ◽  
Linear Expansion ◽  
Task Graph ◽  
Multithreaded Programming ◽  
Performance Guarantees ◽  
Linear Speedup ◽  
Time Required ◽  
Space Requirements ◽  
Parallel Graph ◽  
Single Processor

This paper considers the problem of scheduling dynamic parallel computations to achieve linear speedup without using significantly more space per processor than that required for a single processor execution. Earlier research in the Cilk project proposed the "strict" computational model, in which every dependency goes from a thread x only to one of x's ancestor threads, and guaranteed both linear speedup and linear expansion of space. However, Cilk threads are stateless, and the task graph that Cilk language expresses is series-parallel graph, which is a proper subset of arbitrary task graph. Moreover, Cilk does not support applications with pipelining. We propose the "aligned" multithreaded computational model, which extends the "strict" computational model in Cilk. In the aligned multithreaded computational model, dependencies can go from arbitrary thread x not only to x's ancestor threads, but also to x's younger brother threads, that are spawned by x's parent thread but after x. We use the same measures of time and space as those used in Cilk: T1 is the time required for executing the computation on 1 processor, T∞ is the time required by an infinite number of processors, and S1 is the space required to execute the computation on 1 processor. We show that for any aligned computation, there exists an execution schedule that achieves both efficient time and efficient space. Specifically, we show that for an execution of any aligned multithreaded computation on P processors, the time required is bounded by O(T1/P + T∞), and the space required can be loosely bounded by O(λ·S1P), where λ is the maximum number of younger brother threads that have the same parent thread and can be blocked during execution. If we assume that λ is a constant, and the space requirements for elder and younger brother threads are the same, then the space required would be bounded by O(S1P). Based on the aligned multithreaded computational model, we show that the aligned multithreaded computational model supports pipelined applications. Furthermore, we propose a multithreaded programming language and show that it can express arbitrary task graph.

scholarly journals Design of Distributed Reconfigurable Robotics Systems with ReconROS

2022 ◽  
Vol 15 (3) ◽  
pp. 1-20
Author(s):  
Christian Lienen ◽  
Marco Platzner
Keyword(s):  
Operating System ◽  
Energy Efficiency ◽  
High Performance ◽  
Hardware Acceleration ◽  
Design Flow ◽  
Programming Models ◽  
Unique Combination ◽  
Reconfigurable Computers ◽  
Multithreaded Programming ◽  
Robot Operating System

Robotics applications process large amounts of data in real time and require compute platforms that provide high performance and energy efficiency. FPGAs are well suited for many of these applications, but there is a reluctance in the robotics community to use hardware acceleration due to increased design complexity and a lack of consistent programming models across the software/hardware boundary. In this article, we present ReconROS , a framework that integrates the widely used robot operating system (ROS) with ReconOS, which features multithreaded programming of hardware and software threads for reconfigurable computers. This unique combination gives ROS 2 developers the flexibility to transparently accelerate parts of their robotics applications in hardware. We elaborate on the architecture and the design flow for ReconROS and report on a set of experiments that underline the feasibility and flexibility of our approach.

Multithreaded Programming Using Grand Central Dispatch

2016 ◽  
pp. 499-528
Author(s):  
Molly Maskrey ◽  
Kim Topley ◽  
David Mark ◽  
Fredrik Olsson ◽  
Jeff Lamarche
Keyword(s):  
Multithreaded Programming
Sign in / Sign up

Export Citation Format

Share Document