3,346 research outputs found
The "MIND" Scalable PIM Architecture
MIND (Memory, Intelligence, and Network Device) is an advanced parallel computer architecture for high performance computing and scalable embedded processing. It is a
Processor-in-Memory (PIM) architecture integrating both DRAM bit cells and CMOS logic devices on the same silicon die. MIND is multicore with multiple memory/processor nodes on
each chip and supports global shared memory across systems of MIND components. MIND is distinguished from other PIM architectures in that it incorporates mechanisms for efficient support of a global parallel execution model based on the semantics of message-driven multithreaded split-transaction processing. MIND is designed to operate either in conjunction with other conventional microprocessors or in standalone arrays of like devices. It also incorporates mechanisms for fault tolerance, real time execution, and active power management. This paper describes the major elements and operational methods of the MIND
architecture
Linear and Affine Typing of Continuation-Passing Style
Submitted for the degree of Doctor of Philosophy, Queen Mary, University of Londo
A Type-Theoretic Foundation of Delimited Continuations
International audienceThere is a correspondence between classical logic and programming language calculi with first-class continuations. With the addition of control delimiters, the continuations become composable and the calculi become more expressive. We present a fine-grained analysis of control delimiters and formalise that their addition corresponds to the addition of a single dynamically-scoped variable modelling the special top-level continuation. From a type perspective, the dynamically-scoped variable requires effect annotations. In the presence of control, the dynamically-scoped variable can be interpreted in a purely functional way by applying a store-passing style. At the type level, the effect annotations are mapped within standard classical logic extended with the dual of implication, namely subtraction. A continuation-passing-style transformation of lambda-calculus with control and subtraction is defined. Combining the translations provides a decomposition of standard CPS transformations for delimited continuations. Incidentally, we also give a direct normalisation proof of the simply-typed lambda-calculus with control and subtraction
Explosive synchronization with partial degree-frequency correlation
Networks of Kuramoto oscillators with a positive correlation between the
oscillators frequencies and the degree of the their corresponding vertices
exhibits the so-called explosive synchronization behavior, which is now under
intensive investigation. Here, we study and report explosive synchronization in
a situation that has not yet been considered, namely when only a part,
typically small, of the vertices is subjected to a degree frequency
correlation. Our results show that in order to have explosive synchronization,
it suffices to have degree-frequency correlations only for the hubs, the
vertices with the highest degrees. Moreover, we show that a partial
degree-frequency correlation does not only promotes but also allows explosive
synchronization to happen in networks for which a full degree-frequency
correlation would not allow it. We perform exhaustive numerical experiments for
synthetic networks and also for the undirected and unweighted version of the
neural network of the worm Caenorhabditis elegans. The latter is an explicit
example where partial degree-frequency correlation leads to explosive
synchronization with hysteresis, in contrast with the fully correlated case,
for which no explosive synchronization is observed.Comment: 10 pages, 6 figures, final version to appear in PR
Interface and execution models in the fluke kernel
technical reportWe have defined and implemented a new kernel API that makes every exported operation either fully interruptible and restartable, thereby appearing atomic to the user. To achieve interruptibility, all possible states in which a thread may become blocked for a "long" time are completely representable as valid kernel API calls, without needing to retain any kerncl internal state
A Mechanized Theory of the Box Calculus
The capture calculus is an extension of System F<: that tracks free variables
of terms in their type, allowing one to represent capabilities while limiting
their scope. While previous calculi had mechanized soundness proofs -- notably
System CF<: -- the latest version, namely the box calculus (System CC<:box),
only had a paper proof. We present here our work on mechanizing the theory of
the box calculus in Coq, and the challenges encountered along the way. While
doing so, we motivate the current design of capture calculus, in particular the
concept of boxes, from both user and metatheoretical standpoints. Our
mechanization is complete and available on GitHub.Comment: Proceedings of the 9th International Workshop on Aliasing,
Confinement and Ownership (IWACO '23). ACM, New York, NY, USA, 8 page
- …