Upper bound on the number of processors for scheduling with interprocessor communication delays
- Author
- MOUKRIM, Aziz1
[1] HeuDiaSyC, UMR CNRS 6599, Université de Technologie de Compiègne, Centre de Recherches de Royallieu, BP 20 529, 60205 Compiègne, France - Source
Mathematical methods of operations research (Heidelberg). 2000, Vol 52, Num 1, pp 99-113 ; ref : 13 ref
- ISSN
- 1432-2994
- Scientific domain
- Control theory, operational research
- Publisher
- Physica, Heidelberg
- Publication country
- Germany
- Document type
- Article
- Language
- English
- Keyword (fr)
- Arbre graphe Borne supérieure Contrainte précédence Gestion tâche Multiprocesseur Ordonnancement Problème NP difficile Processeur Système à retard Temps exécution Temps retard Temps total achèvement Temps traitement Communication interprocesseur
- Keyword (en)
- Tree(graph) Upper bound Precedence constraint Task scheduling Multiprocessor Scheduling NP hard problem Processor Delay system Execution time Delay time Makespan Processing time
- Keyword (es)
- Arbol grafo Cota superior Constreñimiento precedencia Gestión labor Multiprocesador Ordonamiento Problema NP duro Procesador Sistema con retardo Tiempo ejecución Tiempo retardo Tiempo total acabamiento Tiempo proceso
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A04 Flows in networks. Combinatorial problems
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A12 Scheduling, sequencing
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D03 Electronics / 001D03F Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices / 001D03F06 Integrated circuits / 001D03F06B Integrated circuits by function (including memories and processors)
- Discipline
- Electronics Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 1494810
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1007/s001860000062 
https://dx.doi.org/10.1007/s001860000062
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1007\/s001860000062\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:95:\"Upper bound on the number of processors for scheduling with interprocessor communication delays\";s:9:\"\u0000*\u0000jtitle\";s:56:\"Mathematical methods of operations research (Heidelberg)\";s:9:\"\u0000*\u0000stitle\";s:35:\"Math. methods oper. res. (Heidelb.)\";s:7:\"\u0000*\u0000date\";s:4:\"2000\";s:9:\"\u0000*\u0000volume\";s:2:\"52\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"99\";s:8:\"\u0000*\u0000epage\";s:3:\"113\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1432-2994\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"MOUKRIM\";s:10:\"\u0000*\u0000aufirst\";s:4:\"Aziz\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:95:\"Upper bound on the number of processors for scheduling with interprocessor communication delays\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:7:\"Physica\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1007\/s001860000062\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:95:\"Upper bound on the number of processors for scheduling with interprocessor communication delays\";s:9:\"\u0000*\u0000jtitle\";s:56:\"Mathematical methods of operations research (Heidelberg)\";s:9:\"\u0000*\u0000stitle\";s:35:\"Math. methods oper. res. (Heidelb.)\";s:7:\"\u0000*\u0000date\";s:4:\"2000\";s:9:\"\u0000*\u0000volume\";s:2:\"52\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"99\";s:8:\"\u0000*\u0000epage\";s:3:\"113\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1432-2994\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"MOUKRIM\";s:10:\"\u0000*\u0000aufirst\";s:4:\"Aziz\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:95:\"Upper bound on the number of processors for scheduling with interprocessor communication delays\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:7:\"Physica\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:21:\"10.1007\/s001860000062\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1007\/s001860000062\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:95:\"Upper bound on the number of processors for scheduling with interprocessor communication delays\";s:9:\"\u0000*\u0000jtitle\";s:56:\"Mathematical methods of operations research (Heidelberg)\";s:9:\"\u0000*\u0000stitle\";s:35:\"Math. methods oper. res. (Heidelb.)\";s:7:\"\u0000*\u0000date\";s:4:\"2000\";s:9:\"\u0000*\u0000volume\";s:2:\"52\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"99\";s:8:\"\u0000*\u0000epage\";s:3:\"113\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1432-2994\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"MOUKRIM\";s:10:\"\u0000*\u0000aufirst\";s:4:\"Aziz\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:95:\"Upper bound on the number of processors for scheduling with interprocessor communication delays\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:7:\"Physica\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1007\/s001860000062\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:95:\"Upper bound on the number of processors for scheduling with interprocessor communication delays\";s:9:\"\u0000*\u0000jtitle\";s:56:\"Mathematical methods of operations research (Heidelberg)\";s:9:\"\u0000*\u0000stitle\";s:35:\"Math. methods oper. res. (Heidelb.)\";s:7:\"\u0000*\u0000date\";s:4:\"2000\";s:9:\"\u0000*\u0000volume\";s:2:\"52\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"99\";s:8:\"\u0000*\u0000epage\";s:3:\"113\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1432-2994\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"MOUKRIM\";s:10:\"\u0000*\u0000aufirst\";s:4:\"Aziz\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:95:\"Upper bound on the number of processors for scheduling with interprocessor communication delays\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:7:\"Physica\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1007\/s001860000062\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:95:\"Upper bound on the number of processors for scheduling with interprocessor communication delays\";s:9:\"\u0000*\u0000jtitle\";s:56:\"Mathematical methods of operations research (Heidelberg)\";s:9:\"\u0000*\u0000stitle\";s:35:\"Math. methods oper. res. (Heidelb.)\";s:7:\"\u0000*\u0000date\";s:4:\"2000\";s:9:\"\u0000*\u0000volume\";s:2:\"52\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"99\";s:8:\"\u0000*\u0000epage\";s:3:\"113\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1432-2994\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"MOUKRIM\";s:10:\"\u0000*\u0000aufirst\";s:4:\"Aziz\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:95:\"Upper bound on the number of processors for scheduling with interprocessor communication delays\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:7:\"Physica\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
