1923 search results - page 273 / 385 » Modeling Complexity in Secure Distributed Computing |
PPOPP
2003
ACM
15 years 3 months ago
2003
ACM
Because of increasing hardware and software complexity, the running time of many computational science applications is now more than the mean-time-to-failure of highpeformance com...
211
click to vote
SACMAT
2011
ACM
14 years 20 days ago
2011
ACM
In this paper, we present an approach for identity and access management (IAM) in the context of (cross-organizational) serviceoriented architectures (SOA). In particular, we deď¬...
ICCS
2007
Springer
15 years 4 months ago
2007
Springer
Kinds of load balancing middleware have already been applied successfully in distributed computing. However, they don’t take the services types into consideration and for differe...
ICS
2004
Tsinghua U.
15 years 3 months ago
2004
Tsinghua U.
The growing dominance of wire delays at future technology points renders a microprocessor communication-bound. Clustered microarchitectures allow most dependence chains to execute...
CLUSTER
2008
IEEE
15 years 4 months ago
2008
IEEE
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...