du.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
BEE COLONIES APPLIED TO MULTIPROCESSOR SCHEDULING
Dalarna University, School of Technology and Business Studies, Computer Engineering.
2009 (English)Independent thesis Advanced level (degree of Master (Two Years))Student thesis
Abstract [en]

In order to achieve the high performance, we need to have an efficient scheduling of a parallel program onto the processors in multiprocessor systems that minimizes the entire execution time. This problem of multiprocessor scheduling can be stated as finding a schedule for a general task graph to be executed on a multiprocessor system so that the schedule length can be minimize [10]. This scheduling problem is known to be NP- Hard. In multi processor task scheduling, we have a number of CPU’s on which a number of tasks are to be scheduled that the program’s execution time is minimized. According to [10], the tasks scheduling problem is a key factor for a parallel multiprocessor system to gain better performance. A task can be partitioned into a group of subtasks and represented as a DAG (Directed Acyclic Graph), so the problem can be stated as finding a schedule for a DAG to be executed in a parallel multiprocessor system so that the schedule can be minimized. This helps to reduce processing time and increase processor utilization. The aim of this thesis work is to check and compare the results obtained by Bee Colony algorithm with already generated best known results in multi processor task scheduling domain.

Place, publisher, year, edition, pages
Borlänge, 2009. , 33 p.
Keyword [en]
bee colonies, scheduling, heuristics
Identifiers
URN: urn:nbn:se:du-3793OAI: oai:dalea.du.se:3793DiVA: diva2:518612
Uppsok
Technology
Supervisors
Available from: 2009-03-12 Created: 2009-03-12 Last updated: 2012-04-24Bibliographically approved

Open Access in DiVA

fulltext(704 kB)773 downloads
File information
File name FULLTEXT01.pdfFile size 704 kBChecksum SHA-512
5473faf2363ef30841f2297c6aa38bbc67597c7a9f07b768c4c6b31392999f036f9afb5a9d1fa998a4b73ad94747caac7b502050c03be7269219006309b9f3a6
Type fulltextMimetype application/pdf

By organisation
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 773 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 565 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf