Most approaches to control-unit optimization use a finite state machine model, where operations are bound to control states. However, when synthesizing circuits from a higher, more abstract level of hardware specification that supports concurrency and synchronization, these approaches may be overly restrictive. We present a strategy for optimizing control circuits based on resynchronization of ...

With version 3.0, the OpenMP specification introduced a task construct and with it an additional dimension of concurrency. While offering a convenient means to express task parallelism, the new construct presents a serious challenge to event-based performance analysis. Since tasking may disrupt the classic sequence of region entry and exit events, essential analysis procedures such as reconstru...

hStreams is a recently proposed (IPDPSW 2016) task-based target-agnostic heterogeneous streaming library that supports task concurrency over heterogeneous platforms. We share our experience of enabling a non-trivial machine learning (ML) algorithm: K-nearest neighbor using hStreams. The K-nearest neighbor (KNN) is a popular algorithm with numerous applications in machine learning, data-mining, ...

Erlang is a functional programming language with support for concurrency and message passing communication that is widely used at Ericsson for developing telecommunication applications. We consider the challenge of verifying temporal properties of Erlang programs which are used to implement systems with dynamically evolving process structures and unbounded data. This is a hard task, which requi...

This paper presents the rationale and design of the concurrency control features of Raven, an object-oriented distributed and parallel programming language and system. Raven's parallel constructs support coarse grained parallelism and are designed to permit programmers to use parallelism with relative ease. To achieve this Raven provides automatic concurrency control on an object's instance dat...

We present a dynamic verification technique for a class of concurrent programming models that combine dataflow and shared memory programming. In this class of hybrid concurrency models, programs are built from tasks whose data dependencies are explicitly defined by a programmer and used by the runtime system to coordinate task execution. Differently from pure dataflow, tasks are allowed to have...

Background and Scope Parallel programming in the multicore era is a challenging task, and novel approaches are needed to ease the development of parallel applications. Transactional memory has been proposed as an alternative to the traditional lock-based approach to express and manage concurrency. During the last few years we have seen an increasing interest in programming languages, run-time s...

The introduction of concurrency complicates the already diicult task of large-scale programming. Concurrent object-oriented languages provide a mechanism, encapsulation, for managing the increased complexity of large-scale concurrent programs, thereby reducing the diiculty of large scale concurrent programming. In particular, ne-grained object-oriented approaches provide modularity through enca...

This article explores three critical topics discussed in the recent debate over concurrency (overlapping sexual partnerships): measurement of the prevalence of concurrency, mathematical modelling of concurrency and HIV epidemic dynamics, and measuring the correlation between HIV and concurrency. The focus of the article is the concurrency hypothesis - the proposition that presumed high prevalen...

Fog computing is a decentralized computer system where data, processing, storage, as well applications are located anywhere between the cloud and data source. takes closer to users, decreasing latency allows deployment of new delay-sensitive appliances. An important feature fog-cloud network process decision-making on assigning resources execute tasks application. This paper aims propose resour...