Find research datasets worth reusing
Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.
11
datasets available to search
ShareScore release 0.9.0
Dataset results
11 results for “parallel programming”
Experiment Results: Evaluation of different parallelisation strategies with regard to the performance of parallel program execution
<p><br> Modern processors achieve an increase in performance by adding multiple cores. This means that during software development, care must be taken to parallelise the program sequences. To make predictions about the performance of a software design, there is Palladio. This is very accurate for single core processors.<br> In this bachelor thesis the influence of the chosen parallelization strategy on the performance of software is examined. Different hardware requirements are used for this purpose. They are used to generate individual work packages. These are executed by different parallelization strategies. The used parallelization strategies are: Java Threads, Java ParallelStreams, OpenMp and Akka Actor. Runtime and cache behavior are measured during each execution. In addition, the experiments are performed on different servers. The evaluation is done using acceleration curves and the Cache Miss Rate. The results show that the parallelization strategies differ only slightly in the work packages used.</p>
Increasing efficiency in parallel programming teaching
<p>The ability to teach parallel programming principles and techniques is becoming fundamental to prepare a new generation of programmers able to master the pervasive parallelism made available by hardware vendors. Classical parallel programming courses leverage either low level programming frameworks (e.g. those based on Pthreads) of higher level programming frameworks such as OpenMP or MPI. We discuss our teaching experience within the Master in “Computer Science and networking” run by blind review where parallel programming is taught leveraging structured parallel programming principles and frameworks. The paper summarizes the results achieved in eight years of experience and shows how the adoption of a structured parallel programming approach improves the efficiency of the teaching process.</p>
Efficient NAS Benchmark Kernels with C++ Parallel Programming Frameworks for Multi-Cores
<p>Benchmarking is a way to study the performance of new architectures and parallel programming frameworks. Well-established benchmark suites such as the NAS Parallel Benchmarks (NPB) comprise legacy codes that still lack portability to C++ language. As consequence, a set of high-level and easy-to-use C++ parallel programming frameworks cannot be tested in NPB. Our goal is to describe a C++ porting of the NPB kernels and to analyze the performance achieved by different parallel implementations written using the Intel TBB, OpenMP and FastFlow frameworks for Multi-Cores. The experiments show an efficient code porting from Fortran to C++ and a good parallel efficiency on average.</p>
A DSL based toolchain for design space exploration in structured parallel programming
<p>We introduce a DSL based toolchain supporting the design of parallel applications where parallelism is structured after parallel design pattern compositions. A DSL provides the possibility to write high level parallel design pattern expressions representing the structure of parallel applications, to refactor the pattern expressions, to evaluate their non-functional properties (e.g. ideal performance, total parallelism degree, etc.) and finally to generate parallel code ready to be compiled and run on different target architectures. We discuss a proof-of-concept prototype implementation of the proposed toolchain generating FastFlow code and show some preliminary results achieved using the prototype implementation.</p>
Replication package for article 'Parallel Program Analysis on Path Ranges'
<p>This Replication package contains all the results for the article "Parallel Program Analysis on Path Ranges"</p> <p>Abstract. Symbolic execution is a software verification technique symbolically running programs and thereby checking for bugs. <br> Ranged symbolic execution <br> performs symbolic execution on program parts, so called {\em path ranges}, in parallel.<br> Due to the parallelism, verification is accelerated and hence scales to larger programs.</p> <p>In this paper, we discuss a generalization of ranged symbolic execution to arbitrary program analyses.<br> More specifically, we present a verification approach that splits programs into path ranges and<br> then runs arbitrary analyses on the ranges in parallel. Our approach in particular allows to run {\em different}<br> analyses on different program parts.<br> We have implemented this generalization on top of the tool \textsc{CPAchecker} and evaluated it on programs from the SV-COMP benchmark. Our evaluation shows that verification can benefit from the parallelisation of the verification task,<br> but also needs a form of work stealing (between analysis) as to become efficient.</p>
Understanding Your Baby: A Parallel Group Study of a Universal Parenting Support Program
ClinicalTrials.gov study NCT03991416. IPD Sharing: NO. Countries: 1. Publications: 1.
Timing Properties and Correctness for Structured Parallel Programs on x86-64 Multicores - Dataset
<p>Multicore architec- tures are increasingly common, but real architectures have unpredictable timing properties, and even correctness is not obvious when systems are built on the relaxed-memory concurrency models that are enforced by commonly-used hardware. This paper takes a rigorous approach to correctness and timing properties, examining common locking protocols from first principles, and extending this through queues to structured parallel constructs. We prove functional correctness and derive simple timing models, extending these for the first time from low-level machine operations to high-level parallel patterns. Our derived high-level timing models for structured parallel programs allow us to accurately predict upper bounds on program execution times on x86-64 multicores. </p> <p> </p> <p>This package contains all the datasets from the paper.</p>
Breast cancer cells survive chemotherapy by activating robust, parallel programs of immune checkpoint expression
GEO Series GSE189302. Mus musculus. 34 samples. Type: Expression profiling by high throughput sequencing; Genome binding/occupancy profiling by high throughput sequencing.
Massively parallel reporter assay for programmed ribosomal frameshifting on designed sequence libraries
GEO Series GSE145684. Homo sapiens. 4 samples. Type: Other.
Supplementary Data: Cloud-based multi-dimensional parallel dynamic programming algorithm for a hydropower station system
<p>The files in this record contain data for cloud-based multi-dimensional parallel dynamic programming algorithm for a hydropower station system considered for publication in Water Resources Research.</p> <p>The files consist of:</p> <ul> <li>cascade reservoir system data;</li> <li>Source code and results of the parallel dynamic programming algorithm program on the physical machine;</li> <li>Source code and results of the parallel dynamic programming algorithm program on the cloud virtual machine;</li> </ul>
Parallel transcriptional programs driving early-starting inheritable lineage bias of myeloid, lymphoid and dendritic cells are initiated by distinct dosage of PU.1 and IRF8 in HSCs
GEO Series GSE89020. Homo sapiens. 26 samples. Type: Expression profiling by high throughput sequencing.
ScienceDex guides
Understand access before you commit
These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.
Allen Brain Atlas
Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.
Annotated Behaviour and Observability Dataset (ABODe)
ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.
DANDI Archive for NWB datasets
DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.
International Brain Laboratory public data
The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.
OpenNeuro
OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.