Sciweavers

858 search results - page 36 / 172
» Sharing the Cost of a Capacity Network
Sort
View
INFOCOM
2000
IEEE
14 years 1 months ago
Effort-limited Fair (ELF) Scheduling for Wireless Networks
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
David A. Eckhardt, Peter Steenkiste
ANCS
2009
ACM
13 years 7 months ago
A lock-free, cache-efficient shared ring buffer for multi-core architectures
We propose MCRingBuffer, a lock-free, cache-efficient shared ring buffer that provides fast data accesses among threads running in multi-core architectures. MCRingBuffer seeks to ...
Patrick P. C. Lee, Tian Bu, Girish P. Chandranmeno...
ISCA
1996
IEEE
133views Hardware» more  ISCA 1996»
14 years 1 months ago
Decoupled Hardware Support for Distributed Shared Memory
This paper investigates hardware support for fine-grain distributed shared memory (DSM) in networks of workstations. To reduce design time and implementation cost relative to dedi...
Steven K. Reinhardt, Robert W. Pfile, David A. Woo...
ICASSP
2011
IEEE
13 years 1 months ago
Multi-graph regularization for efficient delivery of user generated content in online social networks
We present a methodology for enhancing the delivery of usergenerated content in online social networks. To this end, we first regularize the social graph via node capacity and li...
Jacob Chakareski
HPCC
2009
Springer
14 years 1 months ago
Grid Network Dimensioning by Modeling the Deadline Constrained Bulk Data Transfers
—Grid applications need to move large amounts of data between distributed resources within deterministic time frames. In most cases it is possible to specify the volume and the d...
Kashif Munir, Pascale Vicat-Blanc Primet, Michael ...