Sciweavers

1558 search results - page 8 / 312
» Scalable work stealing
Sort
View
CRYPTO
2008
Springer
76views Cryptology» more  CRYPTO 2008»
13 years 11 months ago
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
Ivan Damgård, Yuval Ishai, Mikkel Krø...
WETICE
1998
IEEE
14 years 2 months ago
Enabling Synchronous Joint-Working In Java
This paper gives an outlook on technologies for joint-working with Java-based programs - applets and applications. Various approaches and APIs applied to the Java environment are ...
Vladimir Minenko
OOPSLA
2009
Springer
14 years 4 months ago
The design of a task parallel library
The Task Parallel Library (TPL) is a library for .NET that makes it easy to take advantage of potential parallelism in a program. The library relies heavily on generics and delega...
Daan Leijen, Wolfram Schulte, Sebastian Burckhardt
ICALP
2010
Springer
13 years 11 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran
DAC
2007
ACM
14 years 10 months ago
Trusted Hardware: Can It Be Trustworthy?
Processing and storage of confidential or critical information is an every day occurrence in computing systems. The trustworthiness of computing devices has become an important co...
Cynthia E. Irvine, Karl N. Levitt