Sciweavers

811 search results - page 143 / 163
» A Comparison of Parallel Programming Models of Network Proce...
Sort
View
HIPC
2007
Springer
14 years 11 days ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
WCNC
2008
IEEE
14 years 2 months ago
An Opportunistic Scheduling Scheme with Minimum Data-Rate Guarantees for OFDMA
Abstract—We tackle the problem of providing minimum datarate guarantees for different classes-of-service in an OFDMAbased network, while obtaining a high system throughput. Our a...
Razvan Pitic, Antonio Capone
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
13 years 9 months ago
Towards high speed multiobjective evolutionary optimizers
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder
DCOSS
2011
Springer
12 years 8 months ago
On sensor selection in linked information networks
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun
HPCA
2011
IEEE
12 years 12 months ago
MOPED: Orchestrating interprocess message data on CMPs
Future CMPs will combine many simple cores with deep cache hierarchies. With more cores, cache resources per core are fewer, and must be shared carefully to avoid poor utilization...
Junli Gu, Steven S. Lumetta, Rakesh Kumar, Yihe Su...