Relevant bibliographies by topics / Skeleton-based programming

Contents

  1. Journal articles

Academic literature on the topic 'Skeleton-based programming'

Author: Grafiati
Published: 4 June 2021
Last updated: 2 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Skeleton-based programming.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Skeleton-based programming"

1

Dastgeer, Usman, and Christoph Kessler. "Smart Containers and Skeleton Programming for GPU-Based Systems." International Journal of Parallel Programming 44, no. 3 (2015): 506–30. http://dx.doi.org/10.1007/s10766-015-0357-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Aversa, R., B. Di Martino, N. Mazzocca, and S. Venticinque. "A Skeleton Based Programming Paradigm for Mobile Multi-Agents on Distributed Systems and Its Realization within the MAGDA Mobile Agents Platform." Mobile Information Systems 4, no. 2 (2008): 131–46. http://dx.doi.org/10.1155/2008/745406.

Full text
Abstract:
Parallel programming effort can be reduced by using high level constructs such as algorithmic skeletons. Within the MAGDA toolset, supporting programming and execution of mobile agent based distributed applications, we provide a skeleton-based parallel programming environment, based on specialization of Algorithmic Skeleton Java interfaces and classes. Their implementation include mobile agent features for execution on heterogeneous systems, such as clusters of WSs and PCs, and support reliability and dynamic workload balancing. The user can thus develop a parallel, mobile agent based application by simply specialising a given set of classes and methods and using a set of added functionalities.
APA, Harvard, Vancouver, ISO, and other styles
3

Coppola, Massimo, and Marco Vanneschi. "High-performance data mining with skeleton-based structured parallel programming." Parallel Computing 28, no. 5 (2002): 793–813. http://dx.doi.org/10.1016/s0167-8191(02)00095-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

LOOGEN, RITA, YOLANDA ORTEGA-MALLÉN, and RICARDO PEÑA-MARÍ. "Parallel functional programming in Eden." Journal of Functional Programming 15, no. 3 (2005): 431–75. http://dx.doi.org/10.1017/s0956796805005526.

Full text
Abstract:
Eden extends the non-strict functional language Haskell with constructs to control parallel evaluation of processes. Although processes are defined explicitly, communication and synchronisation issues are handled in a way transparent to the programmer. In order to offer effective support for parallel evaluation, Eden's coordination constructs override the inherently sequential demand-driven (lazy) evaluation strategy of its computation language Haskell. Eden is a general-purpose parallel functional language suitable for developing sophisticated skeletons – which simplify parallel programming immensely – as well as for exploiting more irregular parallelism that cannot easily be captured by a predefined skeleton. The paper gives a comprehensive description of Eden, its semantics, its skeleton-based programming methodology – which is applied in three case studies – its implementation and performance. Furthermore it points at many additional results that have been achieved in the context of the Eden project.
APA, Harvard, Vancouver, ISO, and other styles
5

Aldinucci, Marco, and Marco Danelutto. "Skeleton-based parallel programming: Functional and parallel semantics in a single shot." Computer Languages, Systems & Structures 33, no. 3-4 (2007): 179–92. http://dx.doi.org/10.1016/j.cl.2006.07.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

ALDINUCCI, MARCO. "${\mathsf{eskimo}}$: EXPERIMENTING WITH SKELETONS IN THE SHARED ADDRESS MODEL." Parallel Processing Letters 13, no. 03 (2003): 449–60. http://dx.doi.org/10.1142/s0129626403001410.

Full text
Abstract:
We discuss the lack of expressivity in some skeleton-based parallel programming frameworks. The problem is further exacerbated when approaching irregular problems and dealing with dynamic data structures. Shared memory programming has been argued to have substantial ease of programming advantages for this class of problems. We present the [Formula: see text] library which represents an attempt to merge the two programming models by introducing skeletons in a shared memory framework.
APA, Harvard, Vancouver, ISO, and other styles
7

BISCHOF, HOLGER, SERGEI GORLATCH, and EMANUEL KITZELMANN. "COST OPTIMALITY AND PREDICTABILITY OF PARALLEL PROGRAMMING WITH SKELETONS." Parallel Processing Letters 13, no. 04 (2003): 575–87. http://dx.doi.org/10.1142/s0129626403001525.

Full text
Abstract:
Skeletons are reusable, parameterized program components with well-defined semantics and pre-packaged efficient parallel implementation. This paper develops a new, provably cost-optimal implementation of the DS (double-scan) skeleton for programming divide-and-conquer algorithms. Our implementation is based on a novel data structure called plist (pointed list); implementation's performance is estimated using an analytical model. We demonstrate the use of the DS skeleton for parallelizing a tridiagonal system solver and report experimental results for its MPI implementation on a Cray T3E and a Linux cluster: they confirm the performance improvement achieved by the cost-optimal implementation and demonstrate its good predictability by our performance model.
APA, Harvard, Vancouver, ISO, and other styles
8

Miao, Lu, Shu Yuan Shang, and Chen Xi Cai. "Research on Image Binding Mechanism Based on Kinect Skeletal Tracking in Virtual Fitting System." Applied Mechanics and Materials 376 (August 2013): 437–40. http://dx.doi.org/10.4028/www.scientific.net/amm.376.437.

Full text
Abstract:
On the basis of kinect skeleton track data module, proposing a skeleton track-bound algorithm, you can implement static clothing pictures real time interaction with dynamic characters, combined with WPF in Visual Studio 2010, the corresponding hardware and software resources, a set of accessible and language programming in c# virtual fitting system. Kinect human key joint points coordinates of the corresponding parameter, a corresponding operation, bound to the clothes in the image, makes the image size can be based on different size fitting character change, achieving the desired effect of fitting.
APA, Harvard, Vancouver, ISO, and other styles
9

ZAVANELLA, ANDREA. "SKELETONS, BSP AND PERFORMANCE PORTABILITY." Parallel Processing Letters 11, no. 04 (2001): 393–407. http://dx.doi.org/10.1142/s0129626401000683.

Full text
Abstract:
The Skeletal approach to parallel programming conjugates a high-level compositional style and efficiency. A second advantage of Skeletal programming is portability since implementation decisions are usually taken at compile time. The paper claims that an intermediate model embedding the main performance features of the target architecture facilitates performance portability across parallel architectures. This is motivated by describing the Skel-BSP framework which implements a skeleton system on top of a BSP computer. A prototype compiler based on a set of BSP templates is presented together with a set of performance models for each skeleton which allow a local optimization. The paper also introduces a global optimization strategy using a set of transformation rules. This local+global approach seems a viable solution to writing parallel software in machine-independent way (Writing Once and Compiling Everywhere).
APA, Harvard, Vancouver, ISO, and other styles
10

Tang, Yun Long, Guo Lei Zheng, Bao Rui Du, and Shu Lin Chen. "Tool Path Generation for Top Planar Surface of Ribs in Aircraft Structural Parts." Advanced Materials Research 630 (December 2012): 315–20. http://dx.doi.org/10.4028/www.scientific.net/amr.630.315.

Full text
Abstract:
In order to solve the problem regarding the rapid NC machining programming for top planar surface of ribs in aircraft structural parts, an approach based on skeleton extraction technique is presented here to generate tool path for top planar surface. Firstly, the constrained Delaunay triangulation is built to split the rib top planar surface into several sub areas and approximate skeleton branch of each sub area is extracted. Then based on these skeleton branches and process scheme, the set of machining cells of the rib top planar surface is constructed. Secondly, the problem on determining the sequence of machining cells is resolved by optimizing the machining path. Finally, the sequence of machining cells can be converted into the machining cells chain from which tool path can be calculated by CAM systems. Based on the experimental results of the comparison between the generalized pocket method and our approach, our approach is found to be more efficient in generating tool path for top planar surface of ribs.
APA, Harvard, Vancouver, ISO, and other styles
More sources
You might also be interested in the extended bibliographies on the topic 'Skeleton-based programming' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography