Sciweavers

2452 search results - page 229 / 491
» The Case for Precision Sharing
Sort
View
IOPADS
1997
152views more  IOPADS 1997»
15 years 8 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
CORR
2008
Springer
160views Education» more  CORR 2008»
15 years 6 months ago
Degrees of Freedom of the MIMO Interference Channel with Cooperation and Cognition
In this paper, we explore the benefits, from the perspective of degrees of freedom (DOF), of user cooperation and cognitive message sharing for a two-user multiple-input-multiple-...
Chiachi Huang, Syed Ali Jafar
POPL
2009
ACM
16 years 1 months ago
Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...
Abdallah Al Zain, Kevin Hammond, Jost Berthold, Ph...
ADHOCNOW
2008
Springer
16 years 1 months ago
Adapting BitTorrent to Wireless Ad Hoc Networks
Abstract. BitTorrent is one of the Internet’s most efficient content distribution protocols. It is known to perform very well over the wired Internet where end-to-end performance...
Mohamed Karim Sbai, Chadi Barakat, Jaeyoung Choi, ...
ICPP
2006
IEEE
16 years 24 days ago
Using Gossip for Dynamic Resource Discovery
— Resource discovery is the process of locating shared resources on a computer network. Previously studied examples include efficiently finding files with a given title on a ...
Eric Simonton, Byung Kyu Choi, Steven Seidel