Sciweavers

874 search results - page 63 / 175
» Practical Algorithms for Selection on Coarse-Grained Paralle...
Sort
View
HOTI
2002
IEEE
14 years 3 months ago
A Four-Terabit Single-Stage Packet Switch with Large Round-Trip Time Support
We present the architecture and practical VLSI implementation of a 4-Tb/s single-stage switch. It is based on a combined input- and crosspoint-queued structure with virtual output...
François Abel, Cyriel Minkenberg, Ronald P....
DCOSS
2011
Springer
12 years 10 months ago
On sensor selection in linked information networks
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun
SPAA
2005
ACM
14 years 3 months ago
Value-maximizing deadline scheduling and its application to animation rendering
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri...
ICWS
2010
IEEE
13 years 11 months ago
Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
Patrick Hennig, Wolf-Tilo Balke
ICMT
2009
Springer
14 years 4 months ago
Supporting Parallel Updates with Bidirectional Model Transformations
Abstract. Model-driven software development often involves several related models. When models are updated, the updates need to be propagated across all models to make them consist...
Yingfei Xiong, Hui Song, Zhenjiang Hu, Masato Take...