Sciweavers

1558 search results - page 10 / 312
» Scalable work stealing
Sort
View
ICCCN
2007
IEEE
15 years 4 months ago
Work-Conserving Fair-Aggregation Across Multiple Core Networks
—In the effort of reducing or eliminating per-flow state at routers, hence making QoS schedulers scalable in the core Internet, Flow Aggregation outperforms Dynamic Packet State...
Jorge Arturo Cobb, Zhe Xu
97
Voted
ICCCN
2008
IEEE
15 years 4 months ago
Work-Conserving Fair-Aggregation with Rate-Independent Delay
—Flow aggregation has been proposed as a technique to improve the scalability of QoS scheduling in the core of the Internet, by reducing the amount of per-flow state necessary a...
Jorge Arturo Cobb
104
Voted
JSA
2010
173views more  JSA 2010»
14 years 5 months ago
Hardware/software support for adaptive work-stealing in on-chip multiprocessor
During the past few years, embedded digital systems have been requested to provide a huge amount of processing power and functionality. A very likely foreseeable step to pursue th...
Quentin L. Meunier, Frédéric P&eacut...
102
Voted
ICPADS
2006
IEEE
15 years 4 months ago
Secure and High-Performance Web Server System for Shared Hosting Service
We developed Hi-sap, a web server system that ensures the security in a server and has high performance when processing dynamic content. In existing servers, server embedded progr...
Daisuke Hara, Yasuichi Nakayama
107
Voted
PLDI
2012
ACM
13 years 21 days ago
Scalable and precise dynamic datarace detection for structured parallelism
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...