FIFO Queuing of Constant Length Fully Synchronous Jobs
| dc.contributor.author | Berten, Vandy | |
| dc.contributor.author | Devillers, Raymond | |
| dc.contributor.author | Louchard, Guy | |
| dc.contributor.editor | Kowalczyk, Ryszard | |
| dc.date.accessioned | 2019-05-06T08:56:58Z | |
| dc.date.available | 2019-05-06T08:56:58Z | |
| dc.date.issued | 2007 | |
| dc.description.abstract | The paper examines the behaviour of a saturated multipro- cessor system to which fully synchronous parallel jobs are submitted. In order to simplify the analysis, we assume constant length jobs, a non-preemptive scheduling and a FIFO queue. We determine in particular the number of used CPUs. | en |
| dc.identifier.isbn | 978-3-88579-211-6 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/22152 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e. V. | |
| dc.relation.ispartof | Grid service engineering and management – the 4th international conference on grid service engineering and management – GSEM 2007 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-117 | |
| dc.subject | FIFO scheduling | |
| dc.subject | multiprocessor platforms | |
| dc.subject | Next-Fit Bin- packing | |
| dc.title | FIFO Queuing of Constant Length Fully Synchronous Jobs | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 95 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 81 | |
| gi.conference.date | September 25 - 26, 2007 | |
| gi.conference.location | Leipzig | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1