On-line load balancing of temporary tasksAZAR, Y; KALYANASUNDARAM, B; PLOTKIN, S et al.Journal of algorithms (Print). 1997, Vol 22, Num 1, pp 93-110, issn 0196-6774Article

The Hyperdimensional Tar PitKAMP, Poul-Henning.Communications of the ACM. 2012, Vol 55, Num 3, pp 52-53, issn 0001-0782, 2 p.Article

Task scheduling and voltage selection for energy minimizationZHANA, Yumin; HU, Xiaobo; CHEN, Danny Z et al.Design automation conference. 2002, pp 183-188, isbn 1-58113-461-4, 6 p.Conference Paper

Optimisation du temps de réponse par attribution de priorités aux tâches = Response time optimisation by task priority allocationVILLEN-ALTAMIRANO, M.Revue des Télécommunications. 1988, Vol 62, Num 3-4, pp 280-287, issn 0373-8582Article

First fit decreasing scheduling on uniform multiprocessorsKUNDE, M; STEPPAT, H.Discrete applied mathematics. 1985, Vol 10, Num 2, pp 165-177, issn 0166-218XArticle

Preemptive scheduling to minimize maximum completion time on uniform processors with memory constraintsMARTEL, C.Operations research. 1985, Vol 33, Num 6, pp 1360-1380, issn 0030-364XArticle

Architecture du logiciel du testeur de la procédure X21 = Architecture of software for testing the X21 procedureCHOI, Y; DEBESSON, P.1984, 20 p.Report

Choosing task periods to minimise system utilisation in time triggered systemsBURNS, A; DAVIS, R.Information processing letters. 1996, Vol 58, Num 5, pp 223-229, issn 0020-0190Article

Système optimal de calculs mutuels dans les réseaux de centres de calculsLITVINCHEV, I. S; EHJVAZOV, A. R.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1984, Num 3, pp 64-67, issn 0002-3388Article

Allocating computer resources to satisfy user and management demandsPOSCH, R; HARING, G.Software, practice & experience. 1984, Vol 14, Num 4, pp 311-321, issn 0038-0644Article

Preemptive scheduling of a multiprocessor system with memories to minimize maximum latenessTEN-HWANG LAI; SARTAJ SAHNI.SIAM journal on computing (Print). 1984, Vol 13, Num 4, pp 690-704, issn 0097-5397Article

Sur le (2×n)-problème de Bellman-Jackson dont tous les horaires sont optimauxMEL'NIKOV, O. I.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1984, Num 6, pp 31-33, issn 0002-3574Article

Representing rosters: Conceptual integration counteracts visual complexityCHENG, Peter C-H; BARONE, Rossano.Lecture notes in computer science. 2004, pp 385-387, issn 0302-9743, isbn 3-540-21268-X, 3 p.Conference Paper

Using run-time uncertainty to robustly schedule parallel computationDIETZ, R. D; CASAVANT, T. L; SCHEETZ, T. E et al.Lecture notes in computer science. 1997, pp 13-24, issn 0302-9743, isbn 3-540-63371-5Conference Paper

On the expected relative performance of list schedulingCOFFMAN, E. G. JR; GILBERT, E. N.Operations research. 1985, Vol 33, Num 3, pp 548-561, issn 0030-364XArticle

Construction et réalisation de l'algorithme de planification dans un calcul basé sur le code sémantique universelGUMINSKIJ, A. P; MARTYNOV, V. V.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 5, pp 76-82, issn 0002-3388Article

Formation des propriétés statiques absolues dans les systèmes de calcul en temps réelZURAKHINSKIJ, V. I; TISHCHENKO, V. A.Avtomatika i telemehanika. 1984, Num 6, pp 154-159, issn 0005-2310Article

Implementation and numerical results of an approximation method for constrained saddle point problemsCRISCI, M. R; MORGAN, J.International journal of computer mathematics. 1984, Vol 15, Num 2, pp 163-179, issn 0020-7160Article

Intelligent Methodologies for Scientific Conference ManagementBIBA, Marenglen; FERILLI, Stefano; DI MAURO, Nicola et al.Lecture notes in computer science. 2006, pp 258-267, issn 0302-9743, isbn 3-540-45764-X, 1Vol, 10 p.Conference Paper

Performance of Coffman-Graham schedules in the presence of unit communication delaysHANEN, C; MUNIER, A.Discrete applied mathematics. 1998, Vol 81, Num 1-3, pp 93-108, issn 0166-218XArticle

Algorithmique pour le parallélisme : Certains problèmes d'ordonnancement de tâches et Algorithmes de Couplage = Algorithmic for the parallelism : some problems of task organization and coupling algorithmsGiannakos, Aristotelis; König, Jean-Claude.1997, 122 p.Thesis

Task splitting for three machine preemptive schedulingPICKERING, D; STONE, M. G.Order (Dordrecht). 1991, Vol 7, Num 4, pp 349-352, issn 0167-8094, 4 p.Article

Efficacité des algorithmes approchés de répartition des programmes dans un système de calcul homogèneBAKENROT, V. YU; CHEFRANOV, A. G.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 4, pp 135-148, issn 0002-3388Article

A stochastic optimization algorithm minimizing expected flow times on uniform processorsAGRAWALA, A. K; COFFMAN, E. G. JR; GAREY, M. R et al.IEEE transactions on computers. 1984, Vol 33, Num 4, pp 351-356, issn 0018-9340Article

Distribution optimale des tâches de calcul et des bases de données dans un réseau d'ordinateursTONIEV, K. S; TSVIRKUN, A. D.Avtomatika i telemehanika. 1983, Num 12, pp 122-133, issn 0005-2310Article