Parallel computers, parallel alogrithms, parallel programming Bibliography
Sommer, A., Engeln-Muellges, G., Aachen Technische Hochschule (Germany). Rechenzentrum · OpenGrey (Institut de l'Information Scientifique et Technique) · 1980
Cited by 0
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “Parallel”
Sommer, A., Engeln-Muellges, G., Aachen Technische Hochschule (Germany). Rechenzentrum · OpenGrey (Institut de l'Information Scientifique et Technique) · 1980
Cited by 0
Syracuse University Press eBooks · 2019
Cited by 0
Paula Dempsey · Engineering & Technology · 2008
In the semiconductor business, the most popular programming language is C/C++. However, since multi-core processing architectures moved into the silicon mainstream, it has quickly become apparent that C/C++ does not lend itself well to writing software that fully exploits - or even reflects - the inherent parallelism of today's chips. Multicore development can't wait for new languages so developers are stepping in with, a self-help guide to keeping deadlocks at bay.
Cited by 0
Tony Angel · Bulletin of Miscellaneous Information (Royal Gardens Kew) · 1969
Cited by 0
Albert Y. Zomuyu · 1996
Cited by 0
Zachary Kincaid · TSpace · 2016
This dissertation addresses the problem of automated reasoning about multi-threaded programs. Multi-threaded programs are notoriously prone to error, making them an attractive target for formal methods which can be used to \emph{guarantee} that programs satisfy desirable properties. \emph{Automated} formal methods lift the burden of reasoning about concurrency from software developers onto the shoulders of machines. However, concurrency raises some significant algorithmic challenges for formal methods, particularly in reasoning about complex interactions between threads. This dissertation aims to tame this problem by developing \emph{parallel} logical foundations for multi-threaded programs. Classical approaches to reasoning about multi-threaded programs are based on developing clever ways to reason about them as if they were sequential. There are two prototypical examples of this approach: the \emph{interleaving model} and the \emph{thread-modular model}. In the interleaving model, a multi-threaded program is \emph{compiled} into a sequential program that interleaves the behaviour of all threads, after which we may reason about the program using classical techniques for sequential programs. In the thread-modular model, we reason about each thread independently as a sequential program, subject to side-conditions that enforce that the reasoning about each thread is robust under interference from the others. This dissertation takes a different tack: rather than devise a way to apply sequential reasoning to multi-threaded programs, we develop foundations for reasoning about parallelism directly. On these foundations, we build static analysis and software model checking algorithms for verifying and refuting properties of multi-threaded programs. We show that direct and explicit representation of parallelism enables tractable and precise automated reasoning.
Cited by 2Open access
D. K. G. Campbell · The Computer Journal · 1995
Cited by 0Open access
山口 喜教 · The Journal of the Institute of Electrical Engineers of Japan · 1998
Cited by 0Open access
Alice Echols · 2025
Abstract This chapter traces how the Student Nonviolent Coordinating Committee (SNCC), through the Council of Federated Organizations, transforms its voter registration strategy into a radical experiment in interracial organizing and political empowerment through 1964’s Freedom Summer. Building on the earlier Freedom Vote, SNCC develops parallel institutions like the Mississippi Freedom Democratic Party and Freedom Schools to challenge white supremacy from within and beyond the system. SNCC recruits Northern white students to draw national attention, not merely as allies but as stakeholders in the shared struggle for liberation. Though the Mississippi Project sparks tensions around race, class, and leadership within SNCC, it also redefines solidarity. Finally, the chapter demonstrates how the Project’s achievements—despite internal conflicts and violent backlash—energize communities of rural Black Mississippians, with lasting consequences.
Cited by 0
Thomas Vidick · arXiv (Cornell University) · 2017
We give an arguably simpler and more direct proof of a recent result by Miller, Jain and Shi, who proved device-independent security of a protocol for quantum key distribution in which the devices can be used in parallel. Our proof combines existing results on immunization (Kempe et al., SICOMP 2011) and parallel repetition (Bavarian et al., STOC 2017) of entangled games.
Cited by 11Open access
R.V. Rubin, Larry Rudolph, Dror Zernik · ACM SIGPLAN Notices · 1988
There often exists a large gap between the user's conceptual picture of a parallel machine and the real machine, and between the user's expectations for program execution and the real process of execution. A monitoring and debugging machine can be used to bridge this gap. The Makbilan machine described here creates and maintains in real time a picture of the system that displays different layers of the machine. It can display hardware performance (such as bus accesses, memory references), operating-system abstractions (such as dynamic process tree or resource allocation), and special-purpose animations of the program (designed by the programmer in a constraint-based graphical environment). This paper introduces the design of a non-intrusive monitor with a constraint-based graphic display machine, and is event-driven. The Makbilan machine on which the parallel programs run is under construction, and the monitor is thus designed and simulated in concordance with hardware specifications. The contributions of this paper are: The use of interesting events to integrate a monitor, a debugger and an animation tool for parallel algorithms. A non-intrusive architecture for monitoring executing programs. A flexible animation tool and a set of animations that can be used to understand the parallel structures of parallel algorithms and their execution on a parallel machine.
Cited by 12Open access
Ludwig, Oswaldo · Zenodo (CERN European Organization for Nuclear Research) · 2019
A new seq2seq model for fast training.
Cited by 0Open access
rmower90 · Zenodo (CERN European Organization for Nuclear Research) · 2024
This release pertains to work relevant to "Parallel SnowModel (v1.0): a parallel implementation of a distributed snow-evolution modeling system (SnowModel) in Geoscientific Model Development."
Cited by 0Open access
Edward Kirby · 2010
Cited by 0
rmower90 · Zenodo (CERN European Organization for Nuclear Research) · 2024
This release pertains to work relevant to "Parallel SnowModel (v1.0): a parallel implementation of a distributed snow-evolution modeling system (SnowModel) in Geoscientific Model Development."
Cited by 1Open access
Micah Goodman · Yale University Press eBooks · 2020
Cited by 0
Ananta Tiwari, Vahid Tabatabaee, Jeffrey K. Hollingsworth · Parallel Computing · 2009
Cited by 21
Peter S. Pacheco, Matthew Malensek · Elsevier eBooks · 2021
Cited by 4
Stenbom, Cecilia · Northumbria Research Link (Northumbria University) · 2016
Parallel is a 14-minute long experimental film that examines the enduring resonance of landscape and location in television and cinema. Using strategies of re-enactment, it transposes scenes of narrative fiction and substitutes settings to produce a series of uncanny vignettes. The project began with a call-out for suggestions of film scenes that had been filmed or set near the North Sea and that could then be considered for re-enactment. The call was targeted to community groups based in Northumberland, UK and the greater Gothenburg area in Sweden. Responses brought an eclectic mix of material ranging from crime television drama and science fiction to art-house cinema.
Cited by 0
Huberts, JYJ Job · TU/e Research Portal (Eindhoven University of Technology) · 2014
Cited by 0