Sciweavers

414 search results - page 40 / 83
» A parallel extended GCD algorithm
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
ESSTCP: Enhanced Spread-Spectrum TCP
Having stealth and lightweight authentication methods is empowering network administrators to shelter critical services from adversaries. Spread-Spectrum TCP (SSTCP) [1] is one of...
Amir R. Khakpour, Hakima Chaouchi
ASAP
2003
IEEE
153views Hardware» more  ASAP 2003»
14 years 1 months ago
Hardware Synthesis for Multi-Dimensional Time
This paper introduces basic principles for extending the classical systolic synthesis methodology to multi-dimensional time. Multi-dimensional scheduling enables complex algorithm...
Anne-Claire Guillou, Patrice Quinton, Tanguy Risse...
IPPS
2000
IEEE
14 years 5 days ago
Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs, such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
Wenyi Feng, Fred J. Meyer, Fabrizio Lombardi
IPPS
1999
IEEE
14 years 2 days ago
A Robust Adaptive Metric for Deadline Assignment in Heterogeneous Distributed Real-Time Systems
In a real-time system, tasks are constrained by global endto-end (E-T-E) deadlines. In order to cater for high task schedulability, these deadlines must be distributed over compon...
Jan Jonsson
IPPS
1998
IEEE
14 years 1 days ago
An Evolutionary Approach to Multiprocessor Scheduling of Dependent Tasks
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...
Roman Nossal