Sciweavers

1923 search results - page 31 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
CCS
2006
ACM
14 years 7 days ago
On the modeling and analysis of obligations
Traditional security policies largely focus on access control requirements, which specify who can access what under what circumstances. Besides access control requirements, the av...
Keith Irwin, Ting Yu, William H. Winsborough
ICPPW
2006
IEEE
14 years 2 months ago
m-LPN: An Approach Towards a Dependable Trust Model for Pervasive Computing Applications
Trust, the fundamental basis of ‘cooperation’ – one of the most important characteristics for the performance of pervasive ad hoc network-- is under serious threat with the ...
Munirul M. Haque, Sheikh Iqbal Ahamed
CLUSTER
2006
IEEE
13 years 8 months ago
Distributed File System Virtualization Techniques Supporting On-Demand Virtual Machine Environments for Grid Computing
This paper presents a data management solution which allows fast Virtual Machine (VM) instantiation and efficient run-time execution to support VMs as execution environments in Gri...
Ming Zhao 0002, Jian Zhang 0005, Renato J. O. Figu...
HPCC
2007
Springer
14 years 2 months ago
Towards a Complexity Model for Design and Analysis of PGAS-Based Algorithms
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...
Mohamed Bakhouya, Jaafar Gaber, Tarek A. El-Ghazaw...
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 10 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...