Sciweavers

3563 search results - page 528 / 713
» Scheduling Algorithms for Procrastinators
Sort
View
ASPLOS
1992
ACM
15 years 9 months ago
Efficient Superscalar Performance Through Boosting
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
Michael D. Smith, Mark Horowitz, Monica S. Lam
HIPC
2007
Springer
15 years 9 months 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
HPCN
1995
Springer
15 years 8 months ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck
SIMUTOOLS
2008
15 years 6 months ago
An 802.16 model for NS2 simulator with an integrated QoS architecture
The IEEE 802.16 technology is emerging as a promising solution for BWA due to its ability to support multimedia services and to operate in multiple physical environments. Also, wi...
Ikbal Chammakhi Msadaa, Fethi Filali, Farouk Kamou...
154
Voted
SODA
2007
ACM
115views Algorithms» more  SODA 2007»
15 years 6 months ago
Strong price of anarchy
A strong equilibrium (Aumann 1959) is a pure Nash equilibrium which is resilient to deviations by coalitions. We define the strong price of anarchy to be the ratio of the worst c...
Nir Andelman, Michal Feldman, Yishay Mansour