| Document Date: 2002-10-07 01:29:27
Open Document File Size: 62,66 KBShare Result on Facebook
City Antibes / Genetics / Brisbane / Kanazawa / Taipei / / Company Distributed Systems / Real-Time Systems / / Country Taiwan / France / Japan / Netherlands / Australia / United Kingdom / / / Facility The University of Reading / Engineering Oslo University College / / IndustryTerm multiprocessor taskgraph scheduling algorithms / hybrid genetic algorithms / interconnected processing elements / prioritylist scheduling algorithms / hierarchical communications / approximation algorithm / evolutionary search strategy / stochastic search techniques / processor network / genetic algorithms / duplication-based scheduling algorithms / multiprocessor systems / memory systems / stochastic search / / Organization Engineering Oslo University College / University of Reading / Stanford / / Person Kwok / Ahmad / K. K. Jain / V / Cort Adelers / / / Position Automatic Parallel Controller / / PublishedMedium Marquis / Theoretical Computer Science / The Euromicro Journal / Lecture notes in Computer Science / IEEE Transactions on Computers / / Technology duplication-based algorithm / duplication-based scheduling algorithms / 16 processors / non-duplicationbased algorithms / multiprocessor taskgraph scheduling algorithms / approximation algorithm / hybrid genetic algorithms / same processor / prioritylist scheduling algorithms / scheduling algorithm / Parallel Processing / scheduling algorithms / /
SocialTag |
Using the duplicaticity of a taskgraph to select a suitable multiprocessor scheduling strategy Frode Eika Sandnes Dept. Computer Science, Faculty of Engineering Oslo University College, Cort Adelers gate 30 N-0254 Oslo,