Sciweavers

3507 search results - page 384 / 702
» Specialized execution environments
Sort
View
INFOCOM
1997
IEEE
15 years 11 months ago
An Algorithm to Compute Collusion Paths
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
Steven H. Low, Nicholas F. Maxemchuk
IFL
1997
Springer
15 years 11 months ago
WITH-Loop-Folding in SAC - Condensing Consecutive Array Operations
This paper introduces a new compiler optimization called with-loop-folding. It is based on a special loop construct, the withloop, which in the functional language Sac (for Single ...
Sven-Bodo Scholz
ICCAD
1994
IEEE
105views Hardware» more  ICCAD 1994»
15 years 11 months ago
Register assignment through resource classification for ASIP microcode generation
Application Specific Instruction-Set Processors (ASIPs) offer designers the ability for high-speed data and control processing with the added flexibility needed for late design sp...
Clifford Liem, Trevor C. May, Pierre G. Paulin
PODC
1993
ACM
15 years 11 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
ICS
1992
Tsinghua U.
15 years 11 months ago
The CODE 2.0 graphical parallel programming language
CODE 2.0 is a graphical parallel programming system that targets the three goals of ease of use, portability, and production of efficient parallel code. Ease of use is provided by...
Peter Newton, James C. Browne