Search
Now showing items 81-90 of 141
Heracles: Fully Synthesizable Parameterized MIPS-Based Multicore System
(2010-12-08)
Heracles is an open-source complete multicore system written in Verilog. It is fully parameterized and can be reconfigured and synthesized into different topologies and sizes. Each processing node has a 7-stage pipeline, ...
LEAP Scratchpads: Automatic Memory and Cache Management for Reconfigurable Logic [Extended Version]
(2010-11-23)
Developers accelerating applications on FPGAs or other reconfigurable logic have nothing but raw memory devices in their standard toolkits. Each project typically includes tedious development of single-use memory management. ...
Scalable directoryless shared memory coherence using execution migration
(2010-11-22)
We introduce the concept of deadlock-free migration-based coherent shared memory to the NUCA family of architectures. Migration-based architectures move threads among cores to guarantee sequential semantics in large ...
One-Shot Learning with a Hierarchical Nonparametric Bayesian Model
(2010-10-13)
We develop a hierarchical Bayesian model that learns to learn categories from single training examples. The model transfers acquired knowledge from previously learned categories to a novel category, in the form of a prior ...
Verification of Semantic Commutativity Conditions and Inverse Operations on Linked Data Structures
(2010-12-03)
Commuting operations play a critical role in many parallel computing systems. We present a new technique for verifying commutativity conditions, which are logical formulas that characterize when operations commute. Because ...
From primal templates to invariant recognition
(2010-12-04)
We can immediately recognize novel objects seen only once before -- in different positions on the retina and at different scales (distances). Is this ability hardwired by our genes or learned during development -- and ...
Conservative Rationalizability and The Second-Knowledge Mechanism
(2010-12-20)
In mechanism design, the traditional way of modeling the players' incomplete information about their opponents is "assuming a Bayesian." This assumption, however, is very strong and does not hold in many real applications. ...
Conservative-Bayesian Mechanism Design
(2010-12-20)
Classical Bayesian mechanism design is "centralized," that is, the designer is assumed to know the distribution D from which the players' type profile has been drawn. We instead investigate a very "decentralized" Bayesian ...
Examining high level neural representations of cluttered scenes
(2010-07-29)
Humans and other primates can rapidly categorize objects even when they are embedded in complex visual scenes (Thorpe et al., 1996; Fabre-Thorpe et al., 1998). Studies by Serre et al., 2007 have shown that the ability of ...
Language and Compiler Support for Auto-Tuning Variable-Accuracy Algorithms
(2010-07-27)
Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance optimization in situations where perfect ...