EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 26 / No 1 (1992) RAIRO-Oper. Res., 26 1 (1992) 83-97 References
Free Access
Issue
RAIRO-Oper. Res.
Volume 26, Number 1, 1992
Page(s) 83 - 97
DOI https://doi.org/10.1051/ro/1992260100831
Published online 06 February 2017
  • [ADA,90] W. P. ADAMS, A. BILLIONNET et A. SUTTER, Unconstrained 0-1 Optimisation and Lagrangean Relaxation, Discrete Appl. Math., Discrete Appl. Math., 1990, 29, nos 2-3, p. 131-142. [MR: 1081577] [Zbl: 0725.90067] [Google Scholar]
  • [AND,88] F. ANDRÉ et J. L. PAZAT, Le placement de tâches sur les architectures parallèles. Tech. Sci. Inform., 1988, 7, n° 4, p. 385-401. [Zbl: 0654.68011] [Google Scholar]
  • [BEN,89] D. BENHAMAMOUCH, Résolution approchée d'un problème d'affectation de tâches dans les systèmes informatiques distribués, Thèse de doctorat, Université d'Oran Es Senia, 1989. [Google Scholar]
  • [BIL,85] A. BILLIONNET et M. MINOUX, Maximizing a Supermodular Pseudoboolean Function: a Polynomial Algorithm for Supermodular Cubic Functions, Discrete Appl. Math., 1985, 12, p. 1-11. [MR: 798006] [Zbl: 0583.90067] [Google Scholar]
  • [BIL,88] A. BILLIONNET, M. C. COSTA et A. SUTTER, An efficient Algorithm for a Task Allocation Problem, A.C.M. (à paraître). [Zbl: 0799.68110] [Google Scholar]
  • [BIL,89] A. BILLIONNET, M. C. COSTA et A. SUTTER, Les problèmes de placement dans les systèmes distribués, Tech. Sci. Inform., 1989, 8, n° 4, p. 307-337. [Google Scholar]
  • [BOK,81] S. BOKHARI, A Shortest Tree Algorithm for Optimal Assignments across Space and Time in a Distributed Processor SystemI.E.E.E. Trans. Software Engrg., Nov. 1981, SE-7, n° 6, p. 583-589. [Google Scholar]
  • [BOK,87] S. BOKHARI, Assignment Problems in Parallel and Distributed Computing, Kluwer Academic Publishers, Norwell, Massachusets, USA, 1987, 155 p. [Google Scholar]
  • [BOU,86] P. M. BOURJOLLY, Integral and Fractional Node-Pakings, and Pseudoboolean Programming, Thesis for the degree of Doctor of Philosophy in Combinatorics and Optimization, Université de Waterloo, Ontario, Canada, 1986.Thesis for the degree of Doctor of Philosophy in Combinatorics and Optimization, Université de Waterloo, Ontario, Canada, 1986. [Google Scholar]
  • [EFE,82] K. EFE, Heuristic Models for Task Assignment Scheduling in Distributed Systems Computer, juin 1982, 15, p. 50-56. [Google Scholar]
  • [FER,89] D. FERNANDEZ-BACA, Allocating Modules to Processors in a Distributed System, I.E.E.E. Trans. Software Engrg., 1989, SE-15, n° 11, p. 1427-1436. [Google Scholar]
  • [GAB,84] A. GABRIELIAN et D. B. TYLER, Optimal Object Allocation in Distributed Systems, Proc. of the Int. Conf. on Distributed Computing Systems, San Francisco, California 14-18 May 1984, p. 88-95. [Google Scholar]
  • [GON,85] M. GONDRAM et M. MINOUX, Graphes et algorithmes, Eyrolles, Paris, 1985, 524 p. [MR: 868083] [Zbl: 0497.05023] [Google Scholar]
  • [HAM,84] P. L. HAMMER, P. HANSEN et B. SIMEONE, Roof Duality, Complementation and Persistency in Quadratic 0-1 Optimization, Math. Programming, 1984, 28, p, 121-155. [MR: 733206] [Zbl: 0574.90066] [Google Scholar]
  • [LO,84] V. M. LO, Heuristic Algorithms for Task Assignment in Distributed Systems, Proc. of the int. Conf. on Distributed Computing Systems, San Francisco, California 14-18 May 1984, p. 30-39. [Google Scholar]
  • [LU,84] M. I. LU et J. B. SINCLAIR, Module Assignment in Distributed Systems, Proc. 1984 Computer Network Symposium, Gathersburg, MD, p. 105-111. [Google Scholar]
  • [MA,82] P. R. MA, E. Y. S. LEE et M. TSUCHIYA, A Task Allocation Model for Distributed Computing Systems, I.E.E.E. Trans. Comput., Jan. 1982, C-31, n° 1, p. 66-78. [Google Scholar]
  • [MAG,89] V. F. MAGIROU et J. Z. MILIS, An algorithm for the multiprocessor assignment problem. Oper. Res. Lett., 1989, 8, p. 351-356. [MR: 1035190] [Zbl: 0679.68055] [Google Scholar]
  • [PRI,84] C. C. PRICE et S. KRISHNAPRASAD, Software Allocation Models for Distributed Computing Systems, Proc. of the Int. Conf. on Distributed Computing Systems, San Francisco, California, 14-18 May 1984, p. 40-48. [Google Scholar]
  • [RAO,79] G. S. RAO, H. S. STONE et T. C. HU, Assignment of Tasks in a Distributed Processor System with Limited Memory, I.E.E.E. Trans. Comput., April 1979, C-28, n° 4, p. 291-299. [MR: 528357] [Zbl: 0397.68024] [Google Scholar]
  • [RHY,70] J. RHYS, A Selection Problem of Shared Fixed Costs and Networks, Management Sci., 1970, 17, p. 200-207. [MR: 309537] [Zbl: 0203.52505] [Google Scholar]
  • [SIN,87] J. B. SINCLAIR, Efficient Computation of Optimal Assignments for Distributed Tasks, J. Parallel Dist. Comput., 1987, 4, p. 342-362. [Google Scholar]
  • [SUT,89] A. SUTTER, Programmation non linéaire en variables 0-1, Application à des problèmes de placement de tâches dans un système distribué, Thèse de doctorat du C.N.A.M., juin 1989. [Google Scholar]
  • [TOW,86] D. TOWSLEY, Allocating Programs Containing Branches and Loops within a Multiple Processor System, I.E.E.E. Trans. Software Engrg., 1986, SE-12, n° 10, p. 1018-1024. [Zbl: 0599.68030] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.