Sciweavers

3600 search results - page 33 / 720
» The settling-time reducibility ordering
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
Seekable sockets: a mechanism to reduce copy overheads in TCP-based messaging
This paper extends the traditional socket interface to TCP/IP communication with the ability to seek rather than simply receive data in order. Seeking on a TCP socket allows a use...
Chase Douglas, Vijay S. Pai
ATAL
2006
Springer
13 years 11 months ago
Reducing costly information acquisition in auctions
Most research on auctions assumes that potential bidders have private information about their willingness to pay for the item being auctioned, and that they use this information s...
Kate Larson
CCGRID
2008
IEEE
13 years 9 months ago
Using Probabilistic Characterization to Reduce Runtime Faults in HPC Systems
Abstract--The current trend in high performance computing is to aggregate ever larger numbers of processing and interconnection elements in order to achieve desired levels of compu...
Jim M. Brandt, Bert J. Debusschere, Ann C. Gentile...
IPPS
2007
IEEE
14 years 1 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
DAC
2003
ACM
14 years 27 days ago
NORM: compact model order reduction of weakly nonlinear systems
This paper presents a compact Nonlinear model Order Reduction Method (NORM) that is applicable for time-invariant and time-varying weakly nonlinear systems. NORM is suitable for r...
Peng Li, Lawrence T. Pileggi