Sciweavers

113 search results - page 19 / 23
» Data memory minimization by sharing large size buffers
Sort
View
STACS
2005
Springer
14 years 27 days ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
CGF
2011
13 years 1 months ago
A Parallel SPH Implementation on Multi-Core CPUs
This paper presents a parallel framework for simulating fluids with the Smoothed Particle Hydrodynamics (SPH) method. For low computational costs per simulation step, efficient ...
Markus Ihmsen, Nadir Akinci, Markus Becker, Matthi...
CCR
1999
149views more  CCR 1999»
13 years 7 months ago
A survey of web caching schemes for the Internet
The World Wide Web can be considered as a large distributed information system that provides access to shared data objects. As one of the most popular applications currently runni...
Jia Wang
RAID
2004
Springer
14 years 23 days ago
HoneyStat: Local Worm Detection Using Honeypots
Worm detection systems have traditionally used global strategies and focused on scan rates. The noise associated with this approach requires statistical techniques and large data s...
David Dagon, Xinzhou Qin, Guofei Gu, Wenke Lee, Ju...
IPPS
2010
IEEE
13 years 5 months ago
Highly scalable parallel sorting
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
Edgar Solomonik, Laxmikant V. Kalé