Sciweavers

2416 search results - page 37 / 484
» The design and implementation of typed scheme
Sort
View
FPL
2005
Springer
79views Hardware» more  FPL 2005»
14 years 2 months ago
FPGA-based implementation and comparison of recursive and iterative algorithms
The paper analyses and compares alternative iterative and recursive implementations of FPGA circuits for various problems. Two types of recursive calls have been examined, namely ...
Valery Sklyarov, Iouliia Skliarova, Bruno Figueire...
ISORC
2000
IEEE
14 years 1 months ago
Deadline Handling in Real-Time Distributed Objects
: Deadline handling is a fundamental part of real-time computing but has been practiced in ad hoc forms for decades. A general framework for systematic deadline handling in real-ti...
K. H. Kim, Juqiang Liu, Moon-hae Kim
POS
1994
Springer
14 years 22 days ago
Expressing Object Residency Optimizations Using Pointer Type Annotations
We consider some issues in optimizing persistent programming languages. In particular, we show how to express optimizations of object residency checks in strongly typed persistent...
J. Eliot B. Moss, Antony L. Hosking
IPPS
1999
IEEE
14 years 28 days ago
FPGA Implementation of Modular Exponentiation
An e cient implementations of the main building block in the RSA cryptographic scheme is achieved by mapping a bit-level systolic array for modular exponentiation onto Xilinx FPGAs...
Alexander Tiountchik, Elena Trichina
PPDP
2010
Springer
13 years 7 months ago
Generic record combinators with static type checking
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
Wolfgang Jeltsch