Parallel simulation by multi-instruction, longest-path algorithms
- Author
- CHEN, L1
[1] Lucent Technologies Inc., Room 14D-270, 67 Whippany Road, Whippany, NJ 07981, United States - Source
Queueing systems. 1997, Vol 27, Num 1-2, pp 37-54 ; ref : 21 ref
- ISSN
- 0257-0130
- Scientific domain
- Control theory, operational research; Computer science
- Publisher
- Kluwer, Dordrecht
- Publication country
- Netherlands
- Document type
- Article
- Language
- English
- Keyword (fr)
- Algorithme Calculateur MIMD Calculateur SIMD File attente Ordinateur parallèle Parallélisme massif Réseau file attente Simulation Système attente Traitement parallèle File G/G/1 Plus long chemin
- Keyword (en)
- Algorithm MIMD computer SIMD computer Queue Parallel computer Massive parallelism Queueing network Simulation Queueing system Parallel processing
- Keyword (es)
- Algoritmo Fila espera Ordenador paralelo Paralelismo masivo Red cola espera Simulación Sistema fila espera Tratamiento paralelo
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A05 Queuing theory. Traffic theory
- Discipline
- Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 2159317
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
Install on your browser
"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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:65:\"Parallel simulation by multi-instruction, longest-path algorithms\";s:9:\"\u0000*\u0000jtitle\";s:16:\"Queueing systems\";s:9:\"\u0000*\u0000stitle\";s:13:\"Queueing syst\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"27\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:2:\"37\";s:8:\"\u0000*\u0000epage\";s:2:\"54\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0257-0130\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"CHEN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"L\";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:65:\"Parallel simulation by multi-instruction, longest-path algorithms\";s:8:\"\u0000*\u0000place\";s:9:\"Dordrecht\";s:6:\"\u0000*\u0000pub\";s:6:\"Kluwer\";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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:65:\"Parallel simulation by multi-instruction, longest-path algorithms\";s:9:\"\u0000*\u0000jtitle\";s:16:\"Queueing systems\";s:9:\"\u0000*\u0000stitle\";s:13:\"Queueing syst\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"27\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:2:\"37\";s:8:\"\u0000*\u0000epage\";s:2:\"54\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0257-0130\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"CHEN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"L\";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:65:\"Parallel simulation by multi-instruction, longest-path algorithms\";s:8:\"\u0000*\u0000place\";s:9:\"Dordrecht\";s:6:\"\u0000*\u0000pub\";s:6:\"Kluwer\";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:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:65:\"Parallel simulation by multi-instruction, longest-path algorithms\";s:9:\"\u0000*\u0000jtitle\";s:16:\"Queueing systems\";s:9:\"\u0000*\u0000stitle\";s:13:\"Queueing syst\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"27\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:2:\"37\";s:8:\"\u0000*\u0000epage\";s:2:\"54\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0257-0130\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"CHEN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"L\";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:65:\"Parallel simulation by multi-instruction, longest-path algorithms\";s:8:\"\u0000*\u0000place\";s:9:\"Dordrecht\";s:6:\"\u0000*\u0000pub\";s:6:\"Kluwer\";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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:65:\"Parallel simulation by multi-instruction, longest-path algorithms\";s:9:\"\u0000*\u0000jtitle\";s:16:\"Queueing systems\";s:9:\"\u0000*\u0000stitle\";s:13:\"Queueing syst\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"27\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:2:\"37\";s:8:\"\u0000*\u0000epage\";s:2:\"54\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0257-0130\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"CHEN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"L\";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:65:\"Parallel simulation by multi-instruction, longest-path algorithms\";s:8:\"\u0000*\u0000place\";s:9:\"Dordrecht\";s:6:\"\u0000*\u0000pub\";s:6:\"Kluwer\";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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:65:\"Parallel simulation by multi-instruction, longest-path algorithms\";s:9:\"\u0000*\u0000jtitle\";s:16:\"Queueing systems\";s:9:\"\u0000*\u0000stitle\";s:13:\"Queueing syst\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"27\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:2:\"37\";s:8:\"\u0000*\u0000epage\";s:2:\"54\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0257-0130\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"CHEN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"L\";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:65:\"Parallel simulation by multi-instruction, longest-path algorithms\";s:8:\"\u0000*\u0000place\";s:9:\"Dordrecht\";s:6:\"\u0000*\u0000pub\";s:6:\"Kluwer\";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
