Many-Core architecture oriented parallel algorithm design for computer animation
Yong Cao
- 13 Nov 2011
- pp 180-191
TL;DR: A set of algorithms in computer animation are used as the examples to illustrate several important parallel algorithm design issues, such as computation-to-core mapping, load balancing and algorithm design paradigms, and possible solutions for handling them are provided.
read more
Abstract: Many-core architecture has become an emerging and widely adopted platform for parallel computing. Computer animation researches can harness this advance in high performance computing with better understanding of the architecture and careful consideration of several important parallel algorithm design issues, such as computation-to-core mapping, load balancing and algorithm design paradigms. In this paper, we use a set of algorithms in computer animation as the examples to illustrate these issues, and provide possible solutions for handling them. We have shown in our previous research projects that the proposed solutions can greatly enhance the performance of the parallel algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Fig. 3: The data dependency graph for an example dynamic programming algorithm. The diagonal lines in orange indicate the sweeping frontier for each computation step. All the nodes along these sweeping diagonal lines can be executed in parallel. 
Fig. 6: An example of deferred computing: Pattern Elimination. In the first pass, most of the none-qualified patterns are eliminated by a less constrained and simple process. In the second pass, much less patterns needs to be processed by a complex elimination step. 
Fig. 1: A high-level overview of a many-core parallel architecture. 
Fig. 4: A distributed task scheduling framework for balancing the workload between visualization and simulation on a multi-GPU architecture. 
Fig. 5: A revised distributed task scheduling framework for many-core architectures, where the tasks in the task-pool are sorted first. The tasks with similar workload are submitted to core cluster unit for parallel execution. 
Fig. 2: The processing results of the GPU-accelerated motion tracking algorithm, VCM. Left: Girl dancing with camera zooming in. Right: Hand moving up.
Citations
Ancient Architecture Animation Design Method of 3D Technology and Its Application
Song Li
- 01 Sep 2021
TL;DR: In this article, an ancient architecture animation design method of 3D technology and its application is discussed in the film and television animation production, 3D-technology in the computer set a virtual real world, film-and television animation creator based on the needs of the story using threeD technology in the virtual world to set the appropriate characters and the scenes, and then follow the structure of the stories set The direction of the movement of each model.
3
References
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
- 06 Dec 2004
TL;DR: This paper presents the implementation of MapReduce, a programming model and an associated implementation for processing and generating large data sets that runs on a large cluster of commodity machines and is highly scalable.
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
TL;DR: This presentation explains how the underlying runtime system automatically parallelizes the computation across large-scale clusters of machines, handles machine failures, and schedules inter-machine communication to make efficient use of the network and disks.
Scan primitives for GPU computing
Shubhabrata Sengupta,Mark J. Harris,Yao Zhang,John D. Owens +3 more
- 04 Aug 2007
TL;DR: Using the scan primitives, this work shows novel GPU implementations of quicksort and sparse matrix-vector multiply, and analyzes the performance of the scanPrimitives, several sort algorithms that use the scan Primitives, and a graphical shallow-water fluid simulation using the scan framework for a tridiagonal matrix solver.
Accelerating SQL database operations on a GPU with CUDA
Peter Bakkum,Kevin Skadron +1 more
- 14 Mar 2010
TL;DR: This paper implements a subset of the SQLite command processor directly on the GPU, reducing the effort required to achieve GPU acceleration by avoiding the need for database programmers to use new programming languages such as CUDA or modify their programs to use non-SQL libraries.
Mars: Accelerating MapReduce with Graphics Processors
TL;DR: The experimental results show that, the GPU-CPU coprocessing of Mars on an NVIDIA GTX280 GPU and an Intel quad-core CPU outperformed Phoenix, the state-of-the-art MapReduce on the multicore CPU with a speedup of up to 72 times and 24 times on average, depending on the applications.
167