2002•Computing & Control Engineering JournalRequires access

Probabilistic performance analysis in multiprocessor scheduling

Nimal Nissanke, Amare Leulseged, S. Chillara

Abstract

A novel probabilistic framework for the study of performance issues in multiprocessor scheduling of tasks with uncertain characteristics is proposed. It enables the determination of various performance measures, such as the overall completion rate from a probabilistic picture of the tasks currently under execution, formed from a probabilistic description of newly arriving tasks and assignment of processors. Once optimised, these measures may be used to guide the decisions of schedulers at run time.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 20 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Probabilistic logic, Multiprocessing, Computer science, Scheduling (production processes), Multiprocessor scheduling, Probabilistic analysis of algorithms, Parallel computing, Processor scheduling