1515 search results - page 23 / 303 » Parallel computing on any desktop |
SPAA
1993
ACM
13 years 10 months ago
1993
ACM
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
OSDI
2002
ACM
14 years 7 months ago
2002
ACM
We have created Zap, a novel system for transparent migration of legacy and networked applications. Zap provides a thin virtualization layer on top of the operating system that in...
HPDC
2010
IEEE
13 years 7 months ago
2010
IEEE
MapReduce offers a flexible programming model for processing and generating large data sets on dedicated resources, where only a small fraction of such resources are every unavaila...
ASIACRYPT
2005
Springer
14 years 9 days ago
2005
Springer
Abstract. As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against a...
IEEEPACT
2000
IEEE
13 years 11 months ago
2000
IEEE
Multimedia instruction set extensions have become a prominent feature in desktop microprocessor platforms, promising superior performance on a wide range of floating-point and int...