Researchers are often faced with exploring new research domains. Broad questions about the domain, such as who influential authors or what important topics, difficult to answer due overwhelming number of relevant publications. Therefore, we present litstudy: a Python package that enables answering using simple scripts Jupyter notebooks. The selecting scientific publications and studying their metadata visualizations, bibliographic network analysis, natural language processing. software was...

Building an effective programming model for many-core processors is challenging. On the one hand, increasing variety of platforms and their specific models force users to take a hardware-centric approach not only implementing parallel applications, but also designing them. This diminishes portability and, eventually, limits performance. other effectively cope with increased number large-scale workloads that require parallelization, portable, application-centric desirable. Such enables...

New generations of many-core hardware become available frequently and are typically attractive extensions for data-centers because power-consumption performance benefits. As a result, supercomputers clusters becoming heterogeneous start to contain variety devices. Obtaining from homogeneous cluster-computer is already challenging, but achieving it cluster even more demanding. Related work primarily focuses on clusters. In this paper we present Cashmere, programming system Cashmere tight...

Analyzing digital images is an important investigation in forensics with the ever increasing number of from computers and smartphones. In this article we aim to advance state-of-the-art common image source identification (which originate same camera). To end, present two types applications for different goals that make use a) a modern Desktop computer GPU b) highly heterogeneous cluster many kinds GPUs, something call computing jungles. The first application targets medium-scale...

Summary Many‐core hardware is targeted specifically at obtaining high performance, but reaching performance often challenging because hardware‐specific details have to be taken into account. Although there are many programming systems that try alleviate many‐core programming, some providing a high‐level language, others low‐level language for control, none of these clear and systematic methodology as foundation. In this article, we propose stepwise‐refinement : novel, clear, structured on...

The GPU programming model is primarily aimed at the development of applications that run one GPU. However, this limits scalability code to capabilities a single in terms compute power and memory capacity. To scale further, great engineering effort typically required: work data must be divided over multiple GPUs by hand, possibly nodes, manually spilled from higher-level memories. We present Lightning: framework follows common paradigm but enables scaling large problems with ease. Lightning...

Abstract We present the first parallel algorithms that decide strong and branching bisimilarity in linear time. More precisely, if a transition system has n states, m transitions $$\vert Act \vert $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>|</mml:mo> <mml:mi>A</mml:mi> <mml:mi>c</mml:mi> <mml:mi>t</mml:mi> </mml:mrow> </mml:math> action labels, we introduce an algorithm decides $$\mathcal {O}(n+\vert )$$ <mml:mi>O</mml:mi> <mml:mo>(</mml:mo>...

There are many large scientific applications that have been actively developed for several decades. However, in this time the hardware has evolved considerably. It is taking a very long to get adjusted new computing infrastructure. This because porting these hardware, such as Graphics Processing Units (GPUs), currently requires huge amount of manual labor, even though computations well suited GPUs. In paper we propose an integrated approach semi-automatically port long-lived codes We method...

Documentation is an essential component of Open Source Hardware (OSH) projects both for co-development and replication designs. However, creating documentation keeping it up-to-date often challenging time-intensive. There are several systems that focus on this challenge but they limited in their support relating CAD designs to documentation. This article proposes a semi-automated solution relates the design semantically textual specification from which we generate assembly instructions...

This article presents a way to implement many-sorted term rewriting on GPU. is done by letting the GPU repeatedly perform massively parallel evaluation of all subterms. Innermost experimentally compared with relaxed form innermost rewriting, and two different garbage collection mechanisms, remove terms that are no longer needed, discussed compared. It concluded when rewrite systems exhibit sufficient internal parallelism, substantially outperforms CPU. Both further improve this performance....

All-pairs compute problems apply a user-defined function to each combination of two items given data set. Although these present an abundance parallelism, reuse must be exploited achieve good performance. Several researchers considered this problem, either resorting partial replication with static work distribution or dynamic scheduling full replication. In contrast, we solution that relies on hierarchical multi-level software-based caches maximize at level in the distributed memory...

The GPU programming model is primarily aimed at the development of applications that run one GPU. However, this limits scalability code to capabilities a single in terms compute power and memory capacity. To scale further, great engineering effort typically required: work data must be divided over multiple GPUs by hand, possibly nodes, manually spilled from higher-level memories. We present Lightning: framework follows common paradigm but enables scaling large problems with ease. Lightning...

Divide-and-conquer is a well-known and important programming model that supports efficient execution of parallel applications on multi-cores, clusters, grids. In divide-and-conquer system such as Satin or Cilk, recursive calls are automatically transformed into jobs execute asynchronously. Since the non-blocking, consecutive source parallelism. However, programmer has to manually enforce synchronization with sync statements indicate where wait for result asynchronous jobs. this paper, we...