The following pages link to Denis Trystram (Q310334):
Displaying 50 items.
- (Q222909) (redirect page) (← links)
- Novel dual discounting functions for the Internet shopping optimization problem: new algorithms (Q310335) (← links)
- Decentralized list scheduling (Q367649) (← links)
- Moderately exponential approximation for makespan minimization on related machines (Q392019) (← links)
- Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics (Q433416) (← links)
- Improved approximation algorithms for scheduling parallel jobs on identical clusters (Q496005) (← links)
- A study of scheduling problems with preemptions on multi-core computers with GPU accelerators (Q499342) (← links)
- Scheduling parallel jobs on heterogeneous platforms (Q510901) (← links)
- Scheduling with uncertainties on new computing platforms (Q535305) (← links)
- Scheduling malleable tasks on parallel processors to minimize the makespan (Q596452) (← links)
- Optimal parallel execution of complete binary trees and grids into most popular interconnection networks (Q672453) (← links)
- An efficient parallel algorithm for solving the knapsack problem on hypercubes (Q705566) (← links)
- A new presentation of the conjugate direction algorithm (Q756359) (← links)
- Large scale multiple sequence alignment with simultaneous phylogeny inference (Q860003) (← links)
- Selected papers from the Dagstuhl Workshop (Q880582) (← links)
- Scheduling semi-malleable jobs to minimize mean flow time (Q892832) (← links)
- Analyzing scheduling with transient failures (Q987815) (← links)
- Idle regulation in non-clairvoyant scheduling of parallel jobs (Q1003681) (← links)
- Promoting cooperation in selfish computational grids (Q1042195) (← links)
- Parallel Gaussian elimination on an MIMD computer (Q1096997) (← links)
- Comments on scheduling parallel iterative methods on multiprocessor systems (Q1104039) (← links)
- Broadcasting in wraparound meshes with parallel monodirectional links (Q1199095) (← links)
- Minimizing the overhead for some tree-scheduling problems (Q1278303) (← links)
- Minimizing the schedule length for a parallel 3D-grid precedence graph (Q1278401) (← links)
- Scheduling a divisible task in a two-dimensional toroidal mesh (Q1293188) (← links)
- Scheduling complete intrees on two uniform processors with communication delays (Q1349970) (← links)
- Parallel matrix-vector product on rings with a minimum of communications (Q1351677) (← links)
- Two-dimensional block partitionings for the parallel sparse Cholesky factorization (Q1385158) (← links)
- 1-optimality of static BSP computations: Scheduling independent chains as a case study. (Q1401163) (← links)
- On scheduling send-graphs and receive-graphs under the LogP-model (Q1603551) (← links)
- Special issue on parallel matrix algorithms and applications (Q1603560) (← links)
- An orthogonal systolic array for the algebraic path problem (Q1822502) (← links)
- An approximation algorithm for scheduling trees of malleable tasks (Q1848358) (← links)
- Scheduling chains on uniform processors with communication delays (Q1860371) (← links)
- Improved lower bounds for embedding hypercubes on de Bruijn graphs (Q1881273) (← links)
- Scheduling with a processing time oracle (Q2109845) (← links)
- Impact of communications of the complexity of the parallel Gaussian elimination (Q2277765) (← links)
- Solving SAT in a distributed cloud: a portfolio approach (Q2299084) (← links)
- Exchanging messages of different sizes (Q2369642) (← links)
- Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine (Q2817891) (← links)
- From Preemptive to Non-preemptive Scheduling Using Rejections (Q2817893) (← links)
- APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS (Q2905284) (← links)
- APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM (Q2997925) (← links)
- APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS (Q3021973) (← links)
- (Q3028200) (← links)
- (Q3031898) (← links)
- A Tighter Analysis of Work Stealing (Q3060782) (← links)
- Scheduling Jobs on Heterogeneous Platforms (Q3087956) (← links)
- Approximating the Non-contiguous Multiple Organization Packing Problem (Q3163893) (← links)
- Using preconditioned conjugate gradient for solving consecutive linear systems (Q3481156) (← links)
