Sciweavers

ASPDAC
2005
ACM
109views Hardware» more  ASPDAC 2005»
13 years 6 months ago
Fault tolerant nanoelectronic processor architectures
In this paper we propose a fault-tolerant processor architecture and an associated fault-tolerant computation model capable of fault tolerance in the nanoelectronic environment th...
Wenjing Rao, Alex Orailoglu, Ramesh Karri
FDL
2004
IEEE
13 years 8 months ago
A Functional Programming Framework of Heterogeneous Model of Computation for System Design
System-on-Chip (SOC) and other complex distributed hardware/software systems contain heterogeneous components such as DSPs, micro-controllers, application specific logic etc., whi...
Deepak Mathaikutty, Hiren D. Patel, Sandeep K. Shu...
PLISP
1989
13 years 8 months ago
Speculative Computation in Multilisp
Speculative computing is a technique to improve the execution time of certain applications by starting some computations before it is known that the computations are required. A s...
Randy B. Osborne
ECOOPWEXCEPTION
2000
Springer
13 years 8 months ago
Portable Implementation of Continuation Operators in Imperative Languages by Exception Handling
Abstract. This paper describes a scheme of manipulating (partial) continuations in imperative languages such as Java and C++ in a portable manner, where the portability means that ...
Tatsurou Sekiguchi, Takahiro Sakamoto, Akinori Yon...
ICSE
2001
IEEE-ACM
13 years 9 months ago
A Web-Oriented Architectural Aspect for the Emerging Computational Tapestry
An emerging tapestry of computations will soon integrate systems around the globe. It will evolve without central control. Its complexity will be vast. We need new ideas, tools an...
Kevin J. Sullivan, Avneesh Saxena
FPGA
2001
ACM
123views FPGA» more  FPGA 2001»
13 years 9 months ago
Matching and searching analysis for parallel hardware implementation on FPGAs
Matching and searching computations play an important role in the indexing of data. These computations are typically encoded in very tight loops with a single index variable and a...
Pablo Moisset, Pedro C. Diniz, Joonseok Park
SC
2003
ACM
13 years 9 months ago
Multi-Constraint Mesh Partitioning for Contact/Impact Computations
We present a novel approach for decomposing contact/impact computations in which the mesh elements come in contact with each other during the course of the simulation. Effective d...
George Karypis
PPDP
2004
Springer
13 years 10 months ago
A semantics for tracing declarative multi-paradigm programs
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...
Bernd Brassel, Michael Hanus, Frank Huch, Germ&aac...
COMPGEOM
2004
ACM
13 years 10 months ago
Sampling and meshing a surface with guaranteed topology and geometry
This paper presents an algorithm for sampling and triangulating a generic C2 -smooth surface Σ ⊂ R3 that is input with an implicit equation. The output triangulation is guarant...
Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tath...
IPPS
2005
IEEE
13 years 10 months ago
Reducing Power with Performance Constraints for Parallel Sparse Applications
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...
Guangyu Chen, Konrad Malkowski, Mahmut T. Kandemir...