66 search results - page 4 / 14 » Parallel Reducibility for Information-Theoretically Secure C... |
SAINT
2005
IEEE
14 years 3 months ago
2005
IEEE
This paper presents a case study to effectively run a parallel branch and bound application on the Grid. The application discussed in this paper is a fine-grain application and is...
TPDS
1998
13 years 9 months ago
1998
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
ICDCS
2002
IEEE
14 years 2 months ago
2002
IEEE
A key tree is a distributed data structure of security keys that can be used by a group of users. In this paper, we describe how any user in the group can use the different keys i...
IPPS
2005
IEEE
14 years 3 months ago
2005
IEEE
In order to achieve better scalability and reduce latency in handling user requests, many Web applications make extensive use of data replication through caches and Content Delive...
IPPS
2010
IEEE
13 years 7 months ago
2010
IEEE
Dynamic memory management is one of the most expensive but ubiquitous operations in many C/C++ applications. Additional features such as security checks, while desirable, further w...