21007 search results - page 4046 / 4202 » Mobile Parallel Computing |
APPINF
2003
14 years 11 months ago
2003
Consider a parallel program with n processes and a synchronization granularity z. Consider also two multiprocessors: a multiprocessor with q processors and run-time reallocation o...
APPINF
2003
14 years 11 months ago
2003
There exist a lot of models of parallel computation, amongst which LogP and LogGP are famous and suitable to describe the framework of communication process of Beowulf LINUX Clust...
OPODIS
2004
14 years 11 months ago
2004
Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are ...
86
Voted
USENIX
2001
14 years 11 months ago
2001
Multiple threads running in a single, shared address space is a simple model for writing parallel programs for symmetric multiprocessor (SMP) machines and for overlapping I/O and ...
VG
2001
14 years 11 months ago
2001
In this paper we describe an efficient approach to add shadows to volumetric scenes. The light emitted by the lightsource is properly attenuated by the intervening volumetric struc...