Allocation de ressources et ordonnancement multi-utilisateurs : une approche basée sur l'équité

Les grilles de calcul et le “cloud computing” permettent de distribuer un ensemble de ressources informatiques, telles que du stockage ou du temps de calcul, a un ensemble d’utilisateurs en fonction de leurs demandes en donnant l’illusion de ressources infinies. Cependant, lorsque l’ensemble de ces ressources est insuffisant pour satisfaire les exigences des utilisateurs, des conflits d’interets surgissent. Ainsi, un libre acces a des ressources limitees peut entrainer une utilisation inefficace qui penalise l’ensemble des participants. Dans de tels environnements, il devient necessaire d’etablir des procedures d’arbitrage afin de resoudre ces conflits en garantissant une distribution equitable aux differents utilisateurs. Nous presentons une nouvelle classe de problemes : celle des ordonnancements multi-utilisateurs. Cette these aborde la notion d’equite au travers de problemes d’allocation de ressources sous incertitudes et d’ordonnancement de tâches periodiques.

[1]  Adam Wierman,et al.  Fairness and classifications , 2007, PERV.

[2]  Gérard Verfaillie,et al.  Partage équitable de ressources communes. (1) Un modèle général et son application au partage de ressources satellitaires , 2004, Tech. Sci. Informatiques.

[3]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[4]  Frédéric Vivien,et al.  Minimizing the stretch when scheduling flows of divisible requests , 2008, J. Sched..

[5]  Philippe Lacomme,et al.  Efficient frameworks for greedy split and new depth first search split procedures for routing problems , 2011, Comput. Oper. Res..

[6]  P. Sadayappan,et al.  On fairness in distributed job scheduling across multiple sites , 2004, 2004 IEEE International Conference on Cluster Computing (IEEE Cat. No.04EX935).

[7]  Yunghsiang Sam Han,et al.  Fairness Index Based on Variational Distance , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[8]  Ronald Fagin,et al.  A Fair Carpool Scheduling Algorithm , 1983, IBM J. Res. Dev..

[9]  Berthold Vöcking,et al.  Selfish traffic allocation for server farms , 2002, STOC '02.

[10]  Glaydston Mattos Ribeiro,et al.  A greedy randomized adaptive search procedure for the point-feature cartographic label placement , 2008, Comput. Geosci..

[11]  J. Larmouth,et al.  Scheduling for immediate turnround , 1978, Softw. Pract. Exp..

[12]  G. Hardin,et al.  The Tragedy of the Commons , 1968, Green Planet Blues.

[13]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[14]  Adam Wierzbicki,et al.  Fair Game-Theoretic Resource Management in Dedicated Grids , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[15]  Michael A. Bender,et al.  Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.

[16]  D. Golovin.  Max-min fair allocation of indivisible goods , 2005 .

[17]  A. Lazarev,et al.  A scheme of approximation solution of problem 1 |rj|Lmax , 2007 .

[18]  B. Arnold.  Majorization and the Lorenz Order: A Brief Introduction , 1987 .

[19]  Frédéric Vivien,et al.  Minimizing the stretch when scheduling flows of biological requests , 2006, SPAA '06.

[20]  Safina Ali.  JUSTICE AS FAIRNESS, POLITICAL NOT METAPHYSICAL , 2011 .

[21]  G. Hardy,et al.  Asymptotic formulae in combinatory analysis , 1918 .

[22]  Salvatore Cavalieri,et al.  Proposing and Evaluating Allocation Algorithms in a Grid Environment , 2003, International Conference on Computational Science.

[23]  Gerhard J. Woeginger,et al.  A polynomial-time approximation scheme for maximizing the minimum machine completion time , 1997, Oper. Res. Lett..

[24]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[25]  Philippe Mathieu,et al.  Faut-il toujours suivre Nash? , 2002, JFSMA.

[26]  Yossi Azar.  On-line Load Balancing , 1996, Online Algorithms.

[27]  Alessandro Agnetis,et al.  Multi-agent single machine scheduling , 2007, Ann. Oper. Res..

[28]  Kathryn S. McKinley,et al.  Reconsidering custom memory allocation , 2002, OOPSLA '02.

[29]  Eric Torng,et al.  Mixed Criteria Packet Scheduling , 2007, AAIM.

[30]  J. Keynes,et al.  The General Theory of Employment, Interest and Money. , 1936 .

[31]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[32]  Matthias Ehrgott.  Lexicographic Max-Ordering - A Solution Concept for Multicriteria Combinatorial Optimization , 1995 .

[33]  Guang R. Gao,et al.  A Polynomial Time Method for Optimal Software Pipelining , 1992, CONPAR.

[34]  Gur Mosheiov,et al.  Scheduling problems with two competing agents to minimize minmax and minsum earliness measures , 2010, Eur. J. Oper. Res..

[35]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[36]  Cecchi Marco,et al.  The gLite workload management system , 2008 .

[37]  R. Yager.  On the analytic representation of the Leximin ordering and its application to flexible constraint propagation , 1997 .

[38]  Johan Montagnat,et al.  DERIVING GRID WORKLOAD MODELS FROM USER SUBMISSION STRATEGIES , 2009 .

[39]  L. Gevers,et al.  Leximin and utilitarian rules: A joint characterization , 1978 .

[40]  Alan D. Taylor.  Hervé Moulin, Fair Division and Collective Welfare , 2004 .

[41]  Niklaus Wirth,et al.  Algorithms + Data Structures = Programs , 1976 .

[42]  Edith Elkind,et al.  Guest editorial: special issue on computational social choice , 2010, Autonomous Agents and Multi-Agent Systems.

[43]  M. Clayton,et al.  The Ideal of Equality , 2000 .

[44]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[45]  Moreno Marzolla,et al.  The gLite Workload Management System , 2008, GPC.

[46]  Elchanan Mossel,et al.  On approximately fair allocations of indivisible goods , 2004, EC '04.

[47]  Georges Da Costa,et al.  2005 IEEE International Symposium on Cluster Computing and the Grid , 2005, CCGRID.

[48]  Wolfgang Gentzsch,et al.  Sun Grid Engine: towards creating a compute power grid , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[49]  Tore Grünert,et al.  Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration , 2005, J. Heuristics.

[50]  J. Nash,et al.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[51]  Erwin Laure,et al.  Middleware for the next generation Grid infrastructure , 2004 .

[52]  Ruslan Sadykov,et al.  Experimental comparison of branch-and-bound algorithms for the 1 | r j | L max problem , 2008 .

[53]  Henri Casanova,et al.  Dynamic fractional resource scheduling for HPC workloads , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[54]  Claire Hanen,et al.  A Study of the Cyclic Scheduling Problem on Parallel Processors , 1995, Discret. Appl. Math..

[55]  Andy B. Yoo,et al.  Approved for Public Release; Further Dissemination Unlimited X-ray Pulse Compression Using Strained Crystals X-ray Pulse Compression Using Strained Crystals , 2002 .

[56]  Simon S. Lam,et al.  Queueing network models of packet switching networks , 1981 .

[57]  Gerhard J. Woeginger,et al.  The exact LPT-bound for maximizing the minimum completion time , 1992, Oper. Res. Lett..

[58]  Charles U. Martel,et al.  Scheduling Periodically Occurring Tasks on Multiple Processors , 1981, Inf. Process. Lett..

[59]  Bruno Gaujal,et al.  Index routing for task allocation in Grids , 2005 .

[60]  Dirk Fimmel,et al.  A Flow Graph Formulation of Optimal Software Pipelining , 2002 .

[61]  Benoit Dupont De Dinechin,et al.  Simplex Scheduling: More than Lifetime-Sensitive Instruction Scheduling , 1994 .

[62]  E. L. Lawler,et al.  Recent Results in the Theory of Machine Scheduling , 1982, ISMP.

[63]  Uwe Schwiegelshohn,et al.  Parallel Job Scheduling - A Status Report , 2004, JSSPP.

[64]  V. Bawa.  OPTIMAL, RULES FOR ORDERING UNCERTAIN PROSPECTS+ , 1975 .

[65]  Norman R. Nielsen.  The allocation of computer resources—is pricing the answer? , 1970, CACM.

[66]  Richard C. Larson,et al.  OR Forum - Perspectives on Queues: Social Justice and the Psychology of Queueing , 1987, Oper. Res..

[67]  J. P. Newbury.  Immediate turnround—an elusive goal , 1982, Softw. Pract. Exp..

[68]  Mark J. Clement,et al.  Core Algorithms of the Maui Scheduler , 2001, JSSPP.

[69]  Ashish Goel,et al.  Approximate majorization and fair online load balancing , 2001, TALG.

[70]  Alagan Anpalagan,et al.  Fairness in Radio Resource Management for Wireless Networks , 2009, EURASIP J. Wirel. Commun. Netw..

[71]  K. Arrow,et al.  The New Palgrave Dictionary of Economics , 2020 .

[72]  G. Debreu.  Mathematical Economics: Representation of a preference ordering by a numerical function , 1983 .

[73]  Boaz Patt-Shamir,et al.  General perfectly periodic scheduling , 2002, PODC '02.

[74]  M. Resende,et al.  GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES (GRASP) , 1999 .

[75]  Thomas Sandholm,et al.  Admission Control in a Computational Market , 2008, 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID).

[76]  Baruch Schieber,et al.  Guaranteeing fair service to persistent dependent tasks , 1995, SODA '95.

[77]  Mario Macías,et al.  Enforcing Service Level Agreements Using an Economically Enhanced Resource Manager , 2010, Economic Models and Algorithms for Distributed Systems.

[78]  J. Larmouth.  Scheduling for a share of the machine , 1975, Softw. Pract. Exp..

[79]  Konstantin Avrachenkov,et al.  A Nash Bargaining Solution for Cooperative Network Formation Games , 2011, Networking.

[80]  Anat Rafaeli,et al.  The Effects of Queue Structure on Attitudes , 2002 .

[81]  Ashish Goel,et al.  Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs , 2006, Algorithmica.

[82]  Larry Rudolph,et al.  Parallel Job Scheduling: Issues and Approaches , 1995, JSSPP.

[83]  Ashutosh Sabharwal,et al.  An Axiomatic Theory of Fairness , 2009, ArXiv.

[84]  Werner Sandmann.  Scheduling To Improve Queue Justice , 2006 .

[85]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[86]  Yolanda Gil,et al.  The Role of Planning in Grid Computing , 2003, ICAPS.

[87]  Dirk Fimmel,et al.  Optimal Software Pipelining Under Resource Constraints , 2001, Int. J. Found. Comput. Sci..

[88]  C. Murray Woodside.  Controllability of computer performance tradeoffs obtained using controlled-share queue schedulers , 1986, IEEE Transactions on Software Engineering.

[89]  Johannes Elmsheuser,et al.  A PanDA backend for the ganga analysis interface , 2010 .

[90]  Eric Sanlaville,et al.  Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption , 2004, Eur. J. Oper. Res..

[91]  Sanjoy K. Baruah,et al.  Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.

[92]  G. Whitmore,et al.  Stochastic Dominance for the Class of Completely Monotonic Utility Functions , 1989 .

[93]  Adam Wierzbicki,et al.  A multi-criteria approach to fair and efficient bandwidth allocation , 2008 .

[94]  L. Mann.  Queue Culture: The Waiting Line as a Social System , 1969, American Journal of Sociology.

[95]  B. Avi-Itzhak,et al.  RAQFM : A Resource Allocation Queueing Fairness Measure , 2004 .

[96]  Jason Nieh,et al.  Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler , 2001, USENIX Annual Technical Conference, General Track.

[97]  Miron Livny,et al.  Condor: a distributed job scheduler , 2001 .

[98]  Ulrich Endriss,et al.  Nash Social Welfare in Multiagent Resource Allocation , 2009, AMEC/TADA.

[99]  Radu Prodan,et al.  Negotiation-Based Scheduling of Scientific Grid Workflows Through Advance Reservations , 2010, Journal of Grid Computing.

[100]  Eitan Altman,et al.  Generalized Nash Bargaining Solution for bandwidth allocation , 2006, Comput. Networks.

[101]  Georges-Théodule Guilbaud.  Les théories de l'intérêt général et le problème logique de l'agrégation , 2012 .

[102]  T Maeno,et al.  PanDA: distributed production and distributed analysis system for ATLAS , 2008 .

[103]  Benjamin Avi-Itzhak,et al.  A resource allocation queueing fairness measure: properties and bounds , 2007, Queueing Syst. Theory Appl..

[104]  R. Tyrrell Rockafellar,et al.  Scenarios and Policy Aggregation in Optimization Under Uncertainty , 1991, Math. Oper. Res..

[105]  Hui Li,et al.  Towards A Better Understanding of Workload Dynamics on Data-Intensive Clusters and Grids , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[106]  Evripidis Bampis,et al.  On the truthfulness and the approximation for scheduling selfish tasks , 2007, SPAA '07.

[107]  Bala Kalyanasundaram,et al.  On-Line Load Balancing of Temporary Tasks , 1997, J. Algorithms.

[108]  Eitan Altman,et al.  Inefficient Noncooperation in Networking Games of Common-Pool Resources , 2008, IEEE Journal on Selected Areas in Communications.

[109]  Judy Kay,et al.  A fair share scheduler , 1988, CACM.

[110]  Ian K. T. Tan,et al.  Towards achieving fairness in the Linux scheduler , 2008, OPSR.

[111]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[112]  Kenneth C. Sevcik,et al.  Implementing Multiprocessor Scheduling Disciplines , 1997, JSSPP.

[113]  Rajmohan Rajaraman,et al.  Improved algorithms for stretch scheduling , 2002, SODA '02.

[114]  David Michael Ritchie Park,et al.  On the Semantics of Fair Parallelism , 1979, Abstract Software Specifications.

[115]  H. Dalton.  The Measurement of the Inequality of Incomes , 1920 .

[116]  Martin Skutella,et al.  A Robust PTAS for the Parallel Machine Covering Problem , 2009, Models and Algorithms for Optimization in Logistics.

[117]  Erik Taflin.  Equity allocation and portfolio selection in insurance , 1999 .

[118]  Philippe Massonet,et al.  Using Sla Based Approach To Handle Sabotage Tolerance In The Grids , 2008 .

[119]  A. Sen,et al.  Collective Choice and Social Welfare , 2017 .

[120]  Amitabh Sinha,et al.  Non-Clairvoyant Scheduling for Minimizing Mean Slowdown , 2003, Algorithmica.

[121]  Uwe Schwiegelshohn,et al.  On Advantages of Grid Computing for Parallel Job Scheduling , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[122]  Andrei Tsaregorodtsev,et al.  DIRAC optimized workload management , 2008 .

[123]  J. Nash.  THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[124]  J. M. J. Schutten,et al.  List scheduling revisited , 1996, Oper. Res. Lett..

[125]  E. Polak,et al.  On Multicriteria Optimization , 1976 .

[126]  P. Samuelson.  St. Petersburg Paradoxes: Defanged, Dissected, and Historically Described , 1977 .

[127]  Daniele Varacca.  New Perspectives of Fairness , 2006, Bull. EATCS.

[128]  Radko Mesiar,et al.  Refining Aggregation Operator-Based Orderings in Multifactorial Evaluation—Part I: Continuous Scales , 2007, IEEE Transactions on Fuzzy Systems.

[129]  Deger Cenk Erdil,et al.  Dynamic grid load sharing with adaptive dissemination protocols , 2010, The Journal of Supercomputing.

[130]  Keith W. Hipel,et al.  Lexicographic minimax approach to fair water allocation problems , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[131]  Rajmohan Rajaraman,et al.  Approximation Algorithms for Average Stretch Scheduling , 2004, J. Sched..

[132]  S. Bouveret,et al.  Un algorithme de programmation par contraintes pour la recherche d'allocations leximin-optimales , 2006 .

[133]  Henri Casanova,et al.  Resource Allocation Using Virtual Clusters , 2009, 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid.

[134]  Sid Ahmed Ali Touati,et al.  Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization , 2008, COCOA.

[135]  F. Fabozzi.  Robust Portfolio Optimization and Management , 2007 .

[136]  Michal Pioro,et al.  A Tutorial on Max-Min Fairness and its Applications to Routing, Load-Balancing and Network Design , 2006 .

[137]  William Gropp,et al.  Beowulf Cluster Computing with Linux , 2003 .

[138]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 2002, TNET.

[139]  Peter C. Fishburn,et al.  Decision And Value Theory , 1965 .

[140]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[141]  John R. Gurd,et al.  Market-based grid resource allocation using a stable continuous double auction , 2007, 2007 8th IEEE/ACM International Conference on Grid Computing.

[142]  M. Ehrgott.  A Characterization of Lexicographic Max-Ordering Solutions , 1999 .

[143]  Ibm Redbooks,et al.  Workload Management With Loadleveler , 2001 .

[144]  Ignacio E. Grossmann,et al.  A multistage stochastic programming approach with strategies for uncertainty reduction in the synthesis of process networks with uncertain yields , 2008, Comput. Chem. Eng..

[145]  W. Thomson.  Lorenz rankings of rules for the adjudication of conflicting claims , 2012 .

[146]  J. Keynes.  A Treatise on Probability. , 1923 .

[147]  W. Hamilton,et al.  The evolution of cooperation. , 1984, Science.

[148]  H. Peyton Young,et al.  Equity - in theory and practice , 1994 .

[149]  Didier Dubois,et al.  Semantics of quotient operators in fuzzy relational databases , 1996, Fuzzy Sets Syst..

[150]  Alix Munier Kordon.  The Basic Cyclic Scheduling Problem with Linear Precedence Constraints , 1996, Discret. Appl. Math..

[151]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[152]  W. A. Horn.  Technical Note - Minimizing Average Flow Time with Parallel Machines , 1973, Oper. Res..

[153]  Yossi Azar,et al.  On-Line Machine Covering , 1997, ESA.

[154]  Harold See,et al.  Justice and Equity , 2019, Ancient Legal Thought.

[155]  Fred Glover,et al.  Extensions of the Petal Method for Vehicle Routeing , 1993 .

[156]  Yong He,et al.  Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system , 2004, Science in China Series F: Information Sciences.

[157]  Adam Wierzbicki,et al.  Equitable aggregations and multiple criteria analysis , 2004, Eur. J. Oper. Res..

[158]  Rajeev Motwani,et al.  Non-clairvoyant scheduling , 1994, SODA '93.

[159]  Johannes Elmsheuser,et al.  Ganga: A tool for computational-task management and easy access to Grid resources , 2009, Comput. Phys. Commun..

[160]  Garrick Staples,et al.  TORQUE resource manager , 2006, SC.

[161]  Dah-Ming Chiu,et al.  Some observations on fairness of bandwidth sharing , 2000, Proceedings ISCC 2000. Fifth IEEE Symposium on Computers and Communications.

[162]  Michael T. Marsh,et al.  Equity measurement in facility location analysis: A review and framework , 1994 .

[163]  D. Ellsberg.  Decision, probability, and utility: Risk, ambiguity, and the Savage axioms , 1961 .

[164]  David P. Williamson,et al.  Scheduling Parallel Machines On-Line , 1995, SIAM J. Comput..

[165]  Alessandro Agnetis,et al.  A Lagrangian approach to single-machine scheduling problems with two competing agents , 2009, J. Sched..

[166]  Hans W. Gottinger,et al.  Foundations of lexicographic utility , 1982, Math. Soc. Sci..

[167]  Guohui Lin,et al.  Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times , 1998, Oper. Res. Lett..

[168]  Ahmet B. Keha,et al.  Scheduling interfering job sets on parallel machines , 2009, Eur. J. Oper. Res..

[169]  Amit Kumar,et al.  Fairness measures for resource allocation , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[170]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

[171]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[172]  Wolfgang Effelsberg,et al.  The Fairness Challenge in Computer Networks , 2000, QofIS.

[173]  Włodzimierz Ogryczak.  Location problems from the multiple criteria perspective: efficient solutions , 1998 .

[174]  Jonathan Cole Smith,et al.  A Multiple-Criterion Model for Machine Scheduling , 2003, J. Sched..

[175]  Krzysztof Rzadca,et al.  Cooperation in Multi-organization Scheduling , 2009, Euro-Par.

[176]  Bernard Roy,et al.  Aide multicritère à la décision : méthodes et cas , 1993 .

[177]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[178]  Sally Floyd,et al.  Congestion Control Principles , 2000, RFC.

[179]  Guang R. Gao,et al.  A Framework for Resource-Constrained Rate-Optimal Software Pipelining , 1996, IEEE Trans. Parallel Distributed Syst..

[180]  José Luis González Velarde,et al.  A search heuristic for just-in-time scheduling in parallel machines , 1991, J. Intell. Manuf..

[181]  Denis Trystram,et al.  Multi-users scheduling in parallel systems , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[182]  Mohamed Haouari,et al.  Maximizing the minimum completion time on parallel machines , 2008, 4OR.

[183]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..

[184]  Kirk Pruhs,et al.  Online scheduling , 2003 .

[185]  Uwe Schwiegelshohn,et al.  Fairness in parallel job scheduling , 2000 .

[186]  Yann Chevaleyre,et al.  Issues in Multiagent Resource Allocation , 2006, Informatica.

[187]  Bauchet Pierre.  Pareto (Vilfredo) - Cours d'économie politique , 1965 .

[188]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[189]  P. Fishburn.  The Foundations Of Expected Utility , 2010 .

[190]  Yann Chevaleyre,et al.  A Short Introduction to Computational Social Choice , 2007, SOFSEM.

[191]  Ashish Goel,et al.  Using approximate majorization to characterize protocol fairness , 2001, SIGMETRICS '01.

[192]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[193]  SungWonyong,et al.  Combined word-length optimization and high-level synthesis of digital signal processing systems , 2006 .

[194]  Eddie Dekel,et al.  An overview of lexicographic choice under uncertainty , 1989 .

[195]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[196]  Emmanuel Medernach,et al.  Workload Analysis of a Cluster in a Grid Environment , 2005, JSSPP.

[197]  E. L. Hahne,et al.  Round-Robin Scheduling for Max-Min Fairness in Data Networks , 1991, IEEE J. Sel. Areas Commun..

[198]  D. Norman.  THE PSYCHOLOGY OF WAITING LINES , 2008 .

[199]  Leah Epstein,et al.  Maximizing the minimum load for selfish agents , 2010, Theor. Comput. Sci..

[200]  J. M. J. Schutten,et al.  Restricted dynamic programming: A flexible framework for solving realistic VRPs , 2012, Comput. Oper. Res..

[201]  Jonathan F. Bard,et al.  Flight Scheduling and Maintenance Base Planning , 1989 .

[202]  Bruno Gaujal,et al.  Brokering strategies in computational grids using stochastic prediction models , 2007, Parallel Comput..

[203]  Alessandro Agnetis,et al.  Combinatorial Models for Multi-Agent Scheduling Problems , 2007 .

[204]  Paul R. Wilson,et al.  Dynamic Storage Allocation: A Survey and Critical Review , 1995, IWMM.

[205]  G. Hardy,et al.  Asymptotic Formulaæ in Combinatory Analysis , 1918 .

[206]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[207]  Devavrat Shah,et al.  Fair Scheduling in Networks Through Packet Election , 2011, IEEE Transactions on Information Theory.

[208]  Balakrishna J. Prabhu,et al.  Price of Anarchy in Non-Cooperative Load Balancing , 2010, 2010 Proceedings IEEE INFOCOM.

[209]  Johnny W. Wong,et al.  A Study of Fairness in Packet-Switching Networks , 1982, IEEE Trans. Commun..

[210]  Andrew W. Shogan,et al.  Semi-greedy heuristics: An empirical study , 1987 .

[211]  H. Moulin.  Axioms of Cooperative Decision Making , 1988 .

[212]  N. Megiddo.  A GOOD ALGORITHM FOR LEXICOGRAPHICALLY OPTIMAL FLOWS IN MULTI-TERMINAL NETWORKS , 1977 .

[213]  Benjamin Avi-Itzhak,et al.  Fairness considerations of scheduling in multi-server and multi-queue systems , 2006, valuetools '06.

[214]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[215]  Ian Stokes-Rees,et al.  DIRAC: a scalable lightweight architecture for high throughput computing , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[216]  J. Bentham.  An Introduction to the Principles of Morals and Legislation , 1945, Princeton Readings in Political Thought.

[217]  Eitan Altman,et al.  On fairness in Bandwidth Allocation , 2001 .

[218]  Jean-Charles Billaut,et al.  Flexibility and Robustness in Scheduling , 2008 .

[219]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[220]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[221]  Ronald R. Yager,et al.  On ordered weighted averaging aggregation operators in multicriteria decisionmaking , 1988, IEEE Trans. Syst. Man Cybern..

[222]  A. D. Meglio,et al.  Programming the Grid with gLite , 2006 .

[223]  Josef Hadar,et al.  Rules for Ordering Uncertain Prospects , 1969 .

[224]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .

[225]  Charles U. Martel,et al.  On non-preemptive scheduling of period and sporadic tasks , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[226]  Jean-Yves Le Boudec,et al.  Rate adaptation, Congestion Control and Fairness: A Tutorial , 2000 .

[227]  Rizos Sakellariou,et al.  Scheduling multiple DAGs onto heterogeneous systems , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[228]  M. AdelsonVelskii,et al.  AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .

[229]  Michael M. Kostreva,et al.  Linear optimization with multiple equitable criteria , 1999, RAIRO Oper. Res..

[230]  H. Frankfurt.  Equality as a Moral Ideal , 1987, Ethics.

[231]  Douglas Thain,et al.  Distributed computing in practice: the Condor experience , 2005, Concurr. Pract. Exp..

[232]  Ashish Goel,et al.  Combining fairness with throughput: online routing with multiple objectives , 2000, STOC '00.

[233]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[234]  Emmanouel A. Varvarigos,et al.  Statistical Analysis and Modeling of Jobs in a Grid Environment , 2007, Journal of Grid Computing.

[235]  C. Henry.  Du risque à l'incertitude dans les modèles de décisions , 2005 .

[236]  Tsung-Chyan Lai,et al.  MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING , 1996 .

[237]  J. Keynes,et al.  The General Theory of Employment, Interest and Money. , 1936 .

[238]  Ashish Goel,et al.  Combining Fairness with Throughput: Online Routing with Multiple Objectives , 2001, J. Comput. Syst. Sci..

[239]  Henri Casanova,et al.  On cluster resource allocation for multiple parallel task graphs , 2010, J. Parallel Distributed Comput..

[240]  Jeff Magee,et al.  Scalable, adaptive load sharing for distributed systems , 1993, IEEE Parallel & Distributed Technology: Systems & Applications.

[241]  Keshab K. Parhi,et al.  ILP-based cost-optimal DSP synthesis with module selection and data format conversion , 1998, IEEE Trans. Very Large Scale Integr. Syst..

[242]  Edward D. Lazowska,et al.  Adaptive load sharing in homogeneous distributed systems , 1986, IEEE Transactions on Software Engineering.

[243]  E. Kalai,et al.  OTHER SOLUTIONS TO NASH'S BARGAINING PROBLEM , 1975 .

[244]  François Maniquet,et al.  Social orderings for the assignment of indivisible objects , 2008, J. Econ. Theory.

[245]  Ronaldo M. Salles,et al.  Lexicographic maximin optimisation for fair bandwidth allocation in computer networks , 2008, Eur. J. Oper. Res..

[246]  Philippe Lacomme,et al.  A GRASP×ELS approach for the capacitated location-routing problem , 2010, Comput. Oper. Res..

[247]  Yves De Smet,et al.  About the applicability of MCDA to some robustness problems , 2006, Eur. J. Oper. Res..

[248]  Michael J. Sandel.  The Procedural Republic and the Unencumbered Self , 1984 .

[249]  Dimitri Papadimitriou,et al.  Open Research Issues in Internet Congestion Control , 2011, RFC.

[250]  Krzysztof Rzadca,et al.  Scheduling in Multi-organization Grids: Measuring the Inefficiency of Decentralization , 2007, PPAM.

[251]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[252]  David A. Bader,et al.  Dynamic Load Balancing in Distributed Systems in the Presence of Delays: A Regeneration-Theory Approach , 2007, IEEE Transactions on Parallel and Distributed Systems.

[253]  Vishal Misra,et al.  PBS: a unified priority-based scheduler , 2007, SIGMETRICS '07.

[254]  M. Allais.  Le comportement de l'homme rationnel devant le risque : critique des postulats et axiomes de l'ecole americaine , 1953 .

[255]  Laurent Massoulié,et al.  Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

[256]  Emmanuel Jeannot,et al.  On the distribution of sequential jobs in random brokering for heterogeneous computational grids , 2006, IEEE Transactions on Parallel and Distributed Systems.

[257]  Eduard Ayguadé,et al.  A survey on performance management for internet applications , 2010 .

[258]  Bernard Roy,et al.  Double pondération pour calculer une moyenne : Pourquoi et comment ? , 2007, RAIRO Oper. Res..

[259]  Jonathan F. Bard,et al.  A GRASPTM for a difficult single machine scheduling problem, , 1991, Comput. Oper. Res..

[260]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[261]  Prudence W. H. Wong,et al.  On-line load balancing of temporary tasks revisited , 1999, Theor. Comput. Sci..

[262]  D. Sarne,et al.  Nash Social Welfare in Multiagent Resource Allocation , 2009, AMEC/TADA.

[263]  Martin Hofmann-Apitius,et al.  Grid-Enabled High Throughput Virtual Screening , 2007, GCCB.

[264]  Henri Casanova,et al.  On the Harmfulness of Redundant Batch Requests , 2006, 2006 15th IEEE International Conference on High Performance Distributed Computing.

[265]  Roger B. Myerson,et al.  Game theory - Analysis of Conflict , 1991 .