Modern processors are evolving into hybrid, heterogeneous processors with both CPU and GPU cores used for general purpose computation. Several languages, such as BrookGPU, CUDA, and more recently OpenCL, have been developed to harness the potential of these processors. These languages typically involve control code running on a host CPU, while performance-critical, massively data-parallel kerne...

This paper describes a CUDA implementation of Wagener’s PRAM convex hull algorithm in R 2 [3,2]. It is presented in Knuth’s literate programming style. 1 Using this file The source of this document is a .nw file (for ‘noweb,’ an implementation of Knuth’s literate programming technique: see ‘Literate programming with noweb,’ by Andrew L. Johnson and Brad C. Johnson, Linux Journal, October 1st 19...

Instead of a monolithic programming language trying to cover all features of interest, some programming systems are designed by combining together simpler languages that cooperate to cover the same feature space. This can improve usability by making each part simpler than the whole, but there is a risk of abstraction leaks from one language to another that would break expectations of the users ...

Most computing users today have access to clusters of multi-core computers. To fully utilize a cluster, a programmer must combine two levels of parallelism: shared-memory parallelism within a machine and distributed memory parallelism across machines. Such programming is difficult. Either a user has to mix two programming languages in a single program and use fixed computation and data partitio...

This paper introduces Hypersequent GV (HGV), a modular and extensible core calculus for functional programming with session types that enjoys deadlock freedom, confluence, strong normalisation. HGV exploits hyper-environments, which are collections of type environments, to ensure structural congruence is preserving. As consequence we obtain an operational correspondence between HCP -- process b...

Microgrids are recognized as a relevant tool to absorb decentralized renewable energies in the energy mix. However, sequential handling of multiple stochastic productions and demands, storage, make their management delicate issue. We add another layer complexity by considering microgrids where different buildings stand at nodes network connected arcs; some host local production storage capabili...

There are different methods to build an anonymity service using MIXes. A substantial decision for doing so is the method of choosing the MIX route. In this paper we compare two special configurations: a fixed MIX route used by all participants and a network of freely usable MIXes where each participant chooses his own route. The advantages and disadvantages in respect to the freedom of choice a...

In this paper we show two attacks against universally resilient mix-nets. The first attack can be used against a number of mixnets, including Furukawa-Sako01 [6], Millimix [11], Abe98 [1], MiP-1, MiP-2 [2, 3] and Neff01 [19]. We give the details of the attack in the case of Furukawa-Sako01 mix-net. The second attack breaks the correctness of Millimix [11]. We show how to counter these attacks, ...

This paper presents a genetic algorithm (GA) for solving a generalized model of single-item resource-constrained aggregate production planning (APP) with linear cost functions. APP belongs to a class of pro-duction planning problems in which there is a single production variable representing the total production of all products. We linearize a linear mixed-integer model of APP subject to hiring...