The Computational and Storage Potential of Volunteer Computing, Proceedings of the 6 th IEEE International Symposium on Cluster Computing and the Grid ,
Nondominated Schedules for a Job-Shop with Two Competing Users, In: Computational & Mathematical Organization Theory, vol.62, pp.191-217, 2000. ,
Scheduling Problems with Two Competing Agents, Operations Research, vol.52, issue.2, pp.229-242, 2004. ,
DOI : 10.1287/opre.1030.0092
SETI@home: an experiment in public-resource computing, Communications of the ACM, vol.45, issue.11, pp.56-61, 2002. ,
DOI : 10.1145/581571.581573
BOINC: A System for Public-Resource Computing and Storage, Proceedings of the 5 th IEEE, pp.4-1014, 2004. ,
Orthogonal Packings in Two Dimensions, SIAM Journal on Computing, vol.9, issue.4, pp.846-855, 1980. ,
DOI : 10.1137/0209064
Scheduling independent tasks to reduce mean finishing time, Communications of the ACM, vol.17, issue.7, pp.382-387, 1974. ,
DOI : 10.1145/361011.361064
Approximation Algorithms for Multiple Strip Packing, Proceedings of the 7 th International Workshop on Approximation and Online Algorithms, pp.37-48, 2010. ,
DOI : 10.1007/978-3-642-12450-1_4
URL : https://hal.archives-ouvertes.fr/hal-00953421
Scheduling Algorithms, 2007. ,
Tight Bounds for Selfish and Greedy Load Balancing, Proceedings of the 33 rd International Colloquium on Automata, Languages and Programming ,
Settling the Complexity of Two-Player Nash Equilibrium, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.261-27269, 2006. ,
DOI : 10.1109/FOCS.2006.69
Labs of the World, Unite!!!, In: Journal of Grid Computing, vol.43, pp.225-246, 2006. ,
Coordination Mechanisms, Proceedings of the 31 st International Colloquium on Automata, Languages, and Programming ,
Selfish traffic allocation for server farms, Proceedings of the 34 th annual ACM symposium on Theory of computing, pp.287-296, 2002. ,
Analysis of Multi-Organization Scheduling Algorithms, Lecture Notes in Computer Science, vol.6272, pp.367-379, 2010. ,
DOI : 10.1007/978-3-642-15291-7_34
URL : https://hal.archives-ouvertes.fr/inria-00536510
Coordination mechanisms for selfish multi-organization scheduling, 2011 18th International Conference on High Performance Computing ,
DOI : 10.1109/HiPC.2011.6152720
URL : https://hal.archives-ouvertes.fr/hal-00796864
Multi-organization scheduling approximation algorithms, BIBLIOGRAPHY [Coh+11b] Concurrency and Computation: Practice and Experience, pp.2220-2234, 2011. ,
Comment rater la validation de votre algorithme d'ordonnancement, Proceedings of the 19 th Rencontres francophones du Parallélisme (RenPar) ,
URL : https://hal.archives-ouvertes.fr/hal-00788934
Random graph generation for scheduling simulations, Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques, pp.1-60, 2010. ,
DOI : 10.4108/ICST.SIMUTOOLS2010.8667
URL : https://hal.archives-ouvertes.fr/hal-00471255
Tight Analysis of Relaxed Multi-organization Scheduling Algorithms, 2011 IEEE International Parallel & Distributed Processing Symposium, pp.1177-1186, 2011. ,
DOI : 10.1109/IPDPS.2011.112
URL : https://hal.archives-ouvertes.fr/inria-00592174
Non-clairvoyant Scheduling Games, Proceedings of the 2 nd International Symposium on Algorithmic Game Theory ,
DOI : 10.1007/978-3-642-04645-2_13
Multi-Objective Scheduling ,
DOI : 10.1201/9781420072747-c9
URL : https://hal.archives-ouvertes.fr/hal-00800427
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems Proceedings of the 10 th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Lecture Notes in Computer Science, pp.74-88, 2007. ,
Convergence time to Nash equilibrium in load balancing, ACM Transactions on Algorithms, vol.3, issue.3, 2007. ,
DOI : 10.1145/1273340.1273348
The ANL Intrepid log. The Parallel Workloads Archive, 2009. ,
The Grid Blueprint for a New Computing Infrastructure, pp.978-979, 2004. ,
Selfish unsplittable flows, In: Theoretical Computer Science, vol.348, issue.2, 2005. ,
DOI : 10.1007/978-3-540-27836-8_51
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.9458
Globus Online: Accelerating and Democratizing Science through Cloud-Based Services, Algorithms and Complexity IEEE Internet Computing, vol.15, issue.3, pp.226-239 ,
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game, Proceedings of the 29 th International Colloquium on Automata, Languages, and Programming ,
Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979. ,
Bounds for Certain Multiprocessing Anomalies, Bell System Technical Journal, vol.45, issue.9, pp.1563-1581, 1966. ,
DOI : 10.1002/j.1538-7305.1966.tb01709.x
Bounds on Multiprocessing Timing Anomalies, SIAM Journal on Applied Mathematics, vol.17, issue.2, pp.416-429, 1969. ,
DOI : 10.1137/0117039
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.8131
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, In: Annals of Discrete Mathematics, vol.5, issue.208, pp.287-326, 1979. ,
DOI : 10.1016/S0167-5060(08)70356-X
Preemptive and Non-Preemptive Real-Time UniProcessor Scheduling ,
URL : https://hal.archives-ouvertes.fr/inria-00073732
Reliability versus performance for critical applications, Journal of Parallel and Distributed Computing, vol.69, issue.3, pp.326-336, 2009. ,
DOI : 10.1016/j.jpdc.2008.11.002
URL : https://hal.archives-ouvertes.fr/hal-00753169
The exact bound of Lee's MLPT, Discrete Applied Mathematics, vol.85, issue.3, pp.251-254, 1998. ,
DOI : 10.1016/S0166-218X(97)00139-X
Approximation Algorithms for NP-Hard Problems, pp.978-978, 1997. ,
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach, In: SIAM Journal on Computing, vol.173, pp.539-551, 1988. ,
Coordination mechanisms for selfish scheduling, Internet and Network Economics, pp.1589-1598, 2009. ,
How are Real Grids Used? The Analysis of Four Grid Traces and Its Implications, 2006 7th IEEE/ACM International Conference on Grid Computing, pp.262-269, 2006. ,
DOI : 10.1109/ICGRID.2006.311024
A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems. Tech. rep. Digital Equipment Corporation, Sept. 1984. arXiv:cs/9809099. BIBLIOGRAPHY [JST08] Emmanuel Jeannot, Érik Saule, and Denis Trystram Bi-objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines, Proceedings of the 14 th International Euro-Par Conference. (Las Palmas de Gran Canaria, Spain). Ed. by Emilio Luque, Tomàs Margalef, and Domingo Benítez, pp.877-886, 2008. ,
Fair Share on High Performance Computing Systems: What Does Fair Really Mean, Proceedings of the 3 rd IEEE/ACM International Symposium on Cluster Computing and the Grid, pp.146-153, 2003. ,
Algorithms for multiprocessor scheduling with machine release times, IIE Transactions, vol.45, issue.11, pp.991-999, 1998. ,
DOI : 10.1287/opre.46.3.S1
A Multithreaded Verified Method for Solving Linear Systems in Dual-Core Processors, Proceedings of the 9 th International Workshop on State-of-the-Art in Scientific and Parallel Computing (PARA), 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00542920
Status of the UC-Berkeley SETI Efforts, Proceedings of SPIE. Instruments, Methods, and Missions for Astrobiology XIV ,
Worst-case equilibria ,
DOI : 10.1007/3-540-49116-3_38
Worst-Case Equilibria ,
DOI : 10.1007/3-540-49116-3_38
Parallel machines scheduling with nonsimultaneous machine available time, Discrete Applied Mathematics, vol.30, issue.1, pp.53-61, 1991. ,
DOI : 10.1016/0166-218X(91)90013-M
Handbook of Scheduling: Algorithms, Models, and Performance Analysis Computer and Information Science Series, pp.1-58488, 2004. ,
Condor-a hunter of idle workstations, [1988] Proceedings. The 8th International Conference on Distributed, pp.104-111, 1988. ,
DOI : 10.1109/DCS.1988.12507
Atomic resource sharing in noncooperative networks, Proceedings of INFOCOM '97, pp.385-409, 2001. ,
DOI : 10.1109/INFCOM.1997.631115
Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming, vol.23, issue.1-3, pp.259-271, 1990. ,
DOI : 10.1007/BF01585745
How to measure efficiency? Tech. rep. RR-6216. INRIA, 2007. ,
Bandwidth sharing: objectives and algorithms, IEEE/ACM Transactions on Networking, vol.10, issue.3, pp.320-328, 2002. ,
DOI : 10.1109/TNET.2002.1012364
Non-Cooperative Games, The Annals of Mathematics, vol.2, pp.286-295, 1951. ,
DOI : 10.2307/1969529
A Generalized Multi-Organization Scheduling on Unrelated Parallel Machines, 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies, pp.26-33, 2009. ,
DOI : 10.1109/PDCAT.2009.26
On the complexity of the parity argument and other inefficient proofs of existence, Journal of Computer and System Sciences, vol.48, issue.3, pp.498-532, 1994. ,
DOI : 10.1016/S0022-0000(05)80063-7
Charm++ on NUMA Platforms: the impact of SMP Optimizations and a NUMA-aware Load Balancer. Presented at: The 4 th workshop of the INRIA-Illinois Joint Laboratory on Petascale Computing, 2010. ,
Improving Parallel System Performance with a NUMA-aware Load Balancer, p.2142, 2011. ,
Hypergraph partitioning and clustering In: Handbook of approximation algorithms and metaheurististics. Computer and Information Science Series, 2007. ,
Cooperation in multi-organization scheduling, Concurrency and Computation ,
URL : https://hal.archives-ouvertes.fr/hal-00689789
Collusive behavior in noncooperative epsilon-equilibria of oligopolies with long but finite lives, Journal of Economic Theory, vol.2280, issue.2, pp.136-1540022, 1980. ,
Job Allocation Strategies with User Run Time Estimates for Online Scheduling in Hierarchical Grids, Journal of Grid Computing, vol.3, issue.2, pp.95-116, 2011. ,
DOI : 10.1007/s10723-011-9179-y
Multi-users scheduling in parallel systems, 2009 IEEE International Symposium on Parallel & Distributed Processing, pp.1-9, 2009. ,
DOI : 10.1109/IPDPS.2009.5161037
URL : https://hal.archives-ouvertes.fr/hal-00800421
Online scheduling in grids, 2008 IEEE International Symposium on Parallel and Distributed Processing ,
DOI : 10.1109/IPDPS.2008.4536273
Performance Guarantees of Local Search for Multiprocessor Scheduling, INFORMS Journal on Computing, vol.19, issue.1, pp.52-63, 2007. ,
DOI : 10.1287/ijoc.1050.0152
UK National e-Science Centre definition of e-Science, 2006. ,
Selfish Load Balancing Algorithmic Game Theory, 2007. ,
Characterization of Pareto dominance, Operations Research Letters, vol.31, issue.1, pp.7-11, 2003. ,
DOI : 10.1016/S0167-6377(02)00189-X
The Great Internet Mersenne Prime Search. Feb URL: http://www.mersenne.org, 2011. ,
On-Line Multiple-Strip Packing, Proceedings of the 3 rd International Conference on Combinatorial Optimization and Applications, pp.155-165, 2009. ,
DOI : 10.1007/978-3-642-02026-1_14
URL : http://dx.doi.org/10.1016/j.tcs.2009.09.029
Recent Advances in Multiobjective Optimization ,
DOI : 10.1007/11571155_5
Approximate algorithms to pack rectangles into several strips, In: Discrete Mathematics and Applications, vol.161, pp.73-85, 2006. ,