Sciweavers

1920 search results - page 164 / 384
» The Range Constraint: Algorithms and Implementation
Sort
View
IPPS
2000
IEEE
15 years 8 months ago
Augmenting Modern Superscalar Architectures with Configurable Extended Instructions
The instruction sets of general-purpose microprocessors are designed to offer good performance across a wide range of programs. The size and complexity of the instruction sets, how...
Xianfeng Zhou, Margaret Martonosi
FPGA
2000
ACM
128views FPGA» more  FPGA 2000»
15 years 7 months ago
Factoring large numbers with programmable hardware
The fastest known algorithms for factoring large numbers share a core sieving technique. The sieving cores find numbers that are completely factored over a prime base set raised t...
Hea Joung Kim, William H. Mangione-Smith
AES
2011
Springer
232views Cryptology» more  AES 2011»
14 years 4 months ago
Reliable performance prediction for multigrid software on distributed memory systems
We propose a model for describing and predicting the parallel performance of a broad class of parallel numerical software on distributed memory architectures. The purpose of this ...
Giuseppe Romanazzi, Peter K. Jimack, Christopher E...
CASES
2006
ACM
15 years 10 months ago
High-level languages for small devices: a case study
In this paper we study, through a concrete case, the feasibility of using a high-level, general-purpose logic language in the design and implementation of applications targeting w...
Manuel Carro, José F. Morales, Henk L. Mull...
TON
2010
129views more  TON 2010»
15 years 2 months ago
QoS-based manycasting over optical burst-switched (OBS) networks
Abstract—Many distributed applications require a group of destinations to be coordinated with a single source. Multicasting is a communication paradigm to implement these distrib...
Balagangadhar G. Bathula, Vinod Vokkarane