Fanny Pascual

Approximation Algorithms for Scheduling with Reservations

AbstractWe study the problem of non-preemptively scheduling n independent sequential jobs on a system of m identical parallel machines in the presence of reservations, where m is constant. This setting is practically relevant because for various reasons, some machines may not be available during specified time intervals. The objective is to minimize the makespan Cmax, which is the maximum completion time.The general case of the problem is inapproximable unless

The price of approximate stability for scheduling tasks on two links

\mathsf {P}=\mathsf {NP}

How good are SPT schedules for fair optimality criteria

; hence, we study a suitable strongly

Single approximation for the biobjective Max TSP

\mathsf {NP}

An exponential (matching based) neighborhood for the vehicle routing problem

-hard restriction, namely the case where at least one machine is always available. For this setting we contribute approximation schemes, complemented by inapproximability results. The approach is based on algorithms for multiple subset sum problems; our technique yields a PTAS which is best possible in the sense that an FPTAS is ruled out unless

Scheduling tasks from selfish multi-tasks agents.

\mathsf {P}=\mathsf {NP}

Partition with Side Effects

. The PTAS presented here is the first one for the problem under consideration; so far, not even for well-known special cases approximation schemes have been proposed. Furthermore we derive a low cost algorithm with a constant approximation ratio and discuss FPTASes for special cases as well as the complexity of the problem if m is part of the input.

Truthful Many-to-Many Assignment with Private Weights

Topic 1: Support Tools and Environments.- Topic 1: Support Tools and Environments.- IOAgent: A Parallel I/O Workload Generator.- TDP_SHELL: An Interoperability Framework for Resource Management Systems and Run-Time Monitoring Tools.- Supporting Cache Locality Optimization with a Toolset.- Model-Based Performance Diagnosis of Master-Worker Parallel Computations.- Specification of Inefficiency Patterns for MPI-2 One-Sided Communication.- Topic 2: Performance Prediction and Evaluation.- Topic 2: Performance Prediction and Evaluation.- Hierarchical Model Validation of Symbolic Performance Models of Scientific Kernels.- Tuning Application in a Multi-cluster Environment.- Analyzing the Interaction of OpenMP Programs Within Multiprogramming Environments on a Sun Fire E25K System with PARbench.- Early Experiences with KTAU on the IBM BG/L.- PAM-SoC: A Toolchain for Predicting MPSoC Performance.- Analysis of the Memory Registration Process in the Mellanox InfiniBand Software Stack.- Optimization of Dense Matrix Multiplication on IBM Cyclops-64: Challenges and Experiences.- Optimizing OpenMP Parallelized DGEMM Calls on SGI Altix 3700.- Topic 3: Scheduling and Load Balancing.- Topic 3: Scheduling and Load Balancing.- The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links.- Master-Slave Tasking on Asymmetric Networks.- Using On-the-Fly Simulation for Estimating the Turnaround Time on Non-dedicated Clusters.- An Adaptive Scheduling Method for Grid Computing.- On the Placement of Reservations into Job Schedules.- A Practical Approach of Diffusion Load Balancing Algorithms.- Fast Diffusion Load Balancing Algorithms on Torus Graphs.- A Parallel Shape Optimizing Load Balancer.- Improvement of the Efficiency of Genetic Algorithms for Scalable Parallel Graph Partitioning in a Multi-level Framework.- Probablistic Self-Scheduling.- Data Sharing Conscious Scheduling for Multi-threaded Applications on SMP Machines.- Topic 4: Compilers for High Performance.- Topic 4: Compilers for High Performance.- Compiler Technology for Blue Gene Systems.- SCAN: A Heuristic for Near-Optimal Software Pipelining.- Code Generation for STA Architecture.- Multi-dimensional Kernel Generation for Loop Nest Software Pipelining.- Towards a Versatile Pointer Analysis Framework.- Topic 5: Parallel and Distributed Databases, Data Mining and Knowledge Discovery.- Topic 5: Parallel and Distributed Databases, Data Mining and Knowledge Discovery.- Dynamic and Distributed Reconciliation in P2P-DHT Networks.- HyParSVM - A New Hybrid Parallel Software for Support Vector Machine Learning on SMP Clusters.- Supporting a Real-Time Distributed Intrusion Detection Application on GATES.- On the Use of Semantic Annotations for Supporting Provenance in Grids.- Topic 6: Grid and Cluster Computing: Models, Middleware and Architectures.- Topic 6: Grid and Cluster Computing: Models, Middleware and Architectures.- Supporting Efficient Execution of MPI Applications Across Multiple Sites.- Private Virtual Cluster: Infrastructure and Protocol for Instant Grids.- Reducing Communication Overhead and Page Faults in SDSM Platforms.- Flexible I/O Support for Reconfigurable Grid Environments.- Storage Exchange: A Global Trading Platform for Storage Services.- Vigne: Towards a Self-healing Grid Operating System.- Problems for Resource Brokering in Large and Dynamic Grid Environments.- Topic 7: Parallel Computer Architecture and Instruction Level Parallelism.- Topic 7: Parallel Computer Architecture and Instruction Level Parallelism.- Optimal Integrated VLIW Code Generation with Integer Linear Programming.- Speeding-Up Synchronizations in DSM Multiprocessors.- Design and Effectiveness of Small-Sized Decoupled Dispatch Queues.- Sim-async: An Architectural Simulator for Asynchronous Processor Modeling Using Distribution Functions.- A Hybrid Hardware/Software Generated Prefetching Thread Mechanism on Chip Multiprocessors.- Topic 8: Distributed Systems and Algorithms.- Topic 8: Distributed Systems and Algorithms.- Distributed Approximation Allocation Resources Algorithm for Connecting Groups.- Rollback-Recovery Protocol Guarantying MR Session Guarantee in Distributed Systems with Mobile Clients.- A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks.- Optimal and Practical WAB-Based Consensus Algorithms.- Self-stabilizing Deadlock Detection Under the OR Requirement Model.- Incremental Distributed Garbage Collection Using Reverse Reference Tracking.- Run-Time Switching Between Total Order Algorithms.- On Greedy Graph Coloring in the Distributed Model.- Topic 9: Parallel Programming: Models, Methods and Languages.- Topic 9: Parallel Programming: Models, Methods and Languages.- Surrounding Theorem: Developing Parallel Programs for Matrix-Convolutions.- Dynamic Task Generation and Transformation Within a Nestable Workpool Skeleton.- Data Parallel Iterators for Hierarchical Grid and Tree Algorithms.- Implementing Irregular Parallel Algorithms with OpenMP.- Toward Enhancing OpenMPs Work-Sharing Directives.- Toward a Definition of and Linguistic Support for Partial Quiescence.- Tying Memory Management to Parallel Programming Models.- Topic 10: Parallel Numerical Algorithms.- Topic 10: Parallel Numerical Algorithms.- Parallel LOD Scheme for 3D Parabolic Problem with Nonlocal Boundary Condition.- Online Checkpointing for Parallel Adjoint Computation in PDEs: Application to Goal-Oriented Adaptivity and Flow Control.- Parallel Fault Tolerant Algorithms for Parabolic Problems.- Parallel Solution of Large-Scale and Sparse Generalized Algebraic Riccati Equations.- Applicability of Load Balancing Strategies to Data-Parallel Embedded Runge-Kutta Integrators.- A Software Framework for the Portable Parallelization of Particle-Mesh Simulations.- Parallelization of a Discrete Radiosity Method.- Parallelising Matrix Operations on Clusters for an Optimal Control-Based Quantum Compiler.- Topic 11: Distributed and High-Performance Multimedia.- Topic 11: Distributed and High-Performance Multimedia.- Supporting Reconfigurable Parallel Multimedia Applications.- Providing VCR in a Distributed Client Collaborative Multicast Video Delivery Scheme.- Linear Hashtable Motion Estimation Algorithm for Distributed Video Processing.- Topic 12: Theory and Algorithms for Parallel Computation.- Topic 12: Theory and Algorithms for Parallel Computation.- A Hierarchical CLH Queue Lock.- Competitive Freshness Algorithms for Wait-Free Data Objects.- A Parallel Algorithm for the Two-Dimensional Cutting Stock Problem.- A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers.- On-Line Adaptive Parallel Prefix Computation.- Topic 13: Routing and Communication in Interconnection Networks.- Topic 13: Routing and Communication in Interconnection Networks.- A Model for the Development of AS Fabric Management Protocols.- On the Influence of the Selection Function on the Performance of Fat-Trees.- Scalable Ethernet Clos-Switches.- Towards a Cost-Effective Interconnection Network Architecture with QoS and Congestion Management Support.- Topic 14: Mobile and Ubiquitous Computing.- Topic 14: Mobile and Ubiquitous Computing.- Multi-rated Packet Transmission Scheme for IEEE 802.11 WLAN Networks.- Comparison of Different Methods for Next Location Prediction.- SEER: Scalable Energy Efficient Relay Schemes in MANETs.- Multicost Routing over an Infinite Time Horizon in Energy and Capacity Constrained Wireless Ad-Hoc Networks.- An Adaptive Self-organization Protocol for Wireless Sensor Networks.- COPRA - A Communication Processing Architecture for Wireless Sensor Networks.- DAEDALUS - A Peer-to-Peer Shared Memory System for Ubiquitous Computing.- Context Awareness: An Experiment with Hoarding.- A Client-Server Approach to Enhance Interactive Virtual Environments on Mobile Devices over Wireless Ad Hoc Networks.- Topic 15: Peer-to-Peer and Web Computing.- Topic 15: Peer-to-Peer and Web Computing.- Top k RDF Query Evaluation in Structured P2P Networks.- Roogle: Supporting Efficient High-Dimensional Range Queries in P2P Systems.- Creating and Maintaining Replicas in Unstructured Peer-to-Peer Systems.- DOH: A Content Delivery Peer-to-Peer Network.- Topic 16: Applications of High-Performance and Grid Computing.- Topic 16: Applications of High-Performance and Grid Computing.- Task Pool Teams Implementation of the Master Equation Approach for Random Sierpinski Carpets.- A Preliminary Out-of-Core Extension of a Parallel Multifrontal Solver.- A Parallel Adaptive Cartesian PDE Solver Using Space-Filling Curves.- Load Balanced Parallel Simulated Annealing on a Cluster of SMP Nodes.- A Grid Computing Based Virtual Laboratory for Environmental Simulations.- Exploiting Throughput for Pipeline Execution in Streaming Image Processing Applications.- dCache, Storage System for the Future.- Computing the Diameter of 17-Pancake Graph Using a PC Cluster.- Topic 17: High-Performance Bioinformatics.- Topic 17: High-Performance Bioinformatics.- Multidimensional Dynamic Programming for Homology Search on Distributed Systems.- Load Balancing and Parallel Multiple Sequence Alignment with Tree Accumulation.- ZIB Structure Prediction Pipeline: Composing a Complex Biological Workflow Through Web Services.- Evaluation of Parallel Paradigms on Anisotropic Nonlinear Diffusion.- Improving the Research Environment of High Performance Computing for Non-cluster Experts Based on Knoppix Instant Computing Technology.- Topic 18: Embedded Parallel Systems.- Topic 18: Embedded Parallel Systems.- Efficient Realization of Data Dependencies in Algorithm Partitioning Under Resource Constraints.- FPGA Implementation of a Prototype Hierarchical Control Network for Large-Scale Signal Processing Applications.- An Embedded Systems Programming Environment for C.We consider a \em scheduling game, where a set of selfish agents (traffic loads) want to be routed in exactly one of the two parallel links of a system. Every agent aims to minimize \em her own completion time, while the social objective is the \em makespan, i.e. the time at which the last agent finishes her execution. We study the problem of optimizing the makespan under the constraint that the obtained schedule is a (pure) Nash equilibrium, i.e. a schedule in which no agent has incentive to unilaterally change her strategy (link). We consider a relaxation of the notion of \em equilibrium by considering

Cooperation in Multiorganization Matching

\alpha

Colocating tasks in data centers using a side-effects performance model

-approximate Nash equilibria, in which agents do not have \em sufficient incentive to unilaterally change their strategies: in an