Sciweavers

6437 search results - page 971 / 1288
» Parallel Algorithms for Arrangements
Sort
View
179
Voted
SPAA
2010
ACM
15 years 11 months ago
Brief announcement: byzantine agreement with homonyms
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
COLCOM
2009
IEEE
15 years 11 months ago
Unified analytical models for Location Management costs and optimum design of location areas
—Within collaborative computing, computer mediated communications are evolving rapidly thanks to the development of new technologies. The facilitation of awareness and discovery ...
Eladio Martin, Ling Liu, Matt Weber, Péter ...
CIKM
2009
Springer
15 years 11 months ago
RS-Wrapper: random write optimization for solid state drive
Solid State Drive (SSD), emerging as new data storage media with high random read speed, has been widely used in laptops, desktops, and data servers to replace hard disk during th...
Da Zhou, Xiaofeng Meng
159
Voted
ICA3PP
2009
Springer
15 years 11 months ago
Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation
In this paper, we propose a new universal network, called recursive dual-net (RDN), as a potential candidate for the interconnection network of supercomputers with very large scal...
Yamin Li, Shietung Peng, Wanming Chu
ASAP
2000
IEEE
90views Hardware» more  ASAP 2000»
15 years 11 months ago
Subword Permutation Instructions for Two-Dimensional Multimedia Processing in MicroSIMD Architectures
MicroSIMD architectures incorporating subword parallelism are very efficient for application-specific media processors as well as for fast multimedia information processing in gen...
Ruby B. Lee