A shared-memory multiprocessor scheduling algorithm

Irene Zuccar, Mauricio Solar, Fernanda Kri, Víctor Parada

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)


This paper presents an extension of the Latency Time (LT) scheduling algorithm for assigning tasks with arbitrary execution times on a multiprocessor with shared memory. The Extended Latency Time (ELT) algorithm adds to the priority function the synchronization associated with access to the shared memory. The assignment is carried out associating with each task a time window of the same size as its duration, which decreases for every time unit that goes by. The proposed algorithm is compared with the Insertion Scheduling Heuristic (ISH). Analysis of the results established that ELT has better performance with fine granularity tasks (computing time comparable to synchronization time), and also, when the number of processors available to carry out the assignment increases.

Original languageEnglish
Title of host publicationProfessional Practice in Artificial Intelligence - IFIP 19th World Computer Congress, TC 12
Subtitle of host publicationProfessional Practice Stream
EditorsJohn Debenham
PublisherSpringer New York LLC
Number of pages9
ISBN (Print)9780387346557
Publication statusPublished - 2006
Externally publishedYes
Event2nd Symposium on Professional Practice in Artificial Intelligence, 2006 - Santiago, Chile
Duration: 21 Aug 200624 Aug 2006

Publication series

NameIFIP Advances in Information and Communication Technology
ISSN (Print)1868-4238


Conference2nd Symposium on Professional Practice in Artificial Intelligence, 2006

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Information Systems and Management


Dive into the research topics of 'A shared-memory multiprocessor scheduling algorithm'. Together they form a unique fingerprint.

Cite this