1983IEEE Transactions on Power Apparatus and SystemsRequires access

Task Scheduling on Multiprocessors for Power System Problems

Ravi Mehrotra, Sarosh Talukdar

Open publisher page 5 citations

Abstract

The paper describes a technique f or estimating the minimum execution time of an algorithm or a mix of algorithms on a multiprocessor. Some changes to the multiprocessor structure to further reduce the execution time are identified.

About this research paper

What this paper is about

The paper describes a technique f or estimating the minimum execution time of an algorithm or a mix of algorithms on a multiprocessor. Some changes to the multiprocessor structure to further reduce the execution time are identified.

Why it matters

OpenAlex reports 5 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

The paper describes a technique f or estimating the minimum execution time of an algorithm or a mix of algorithms on a multiprocessor. Some changes to the multiprocessor structure to further reduce the execution time are identified.

Key concepts: Multiprocessing, Computer science, Parallel computing, Multiprocessor scheduling, Processor scheduling, Scheduling (production processes), Task (project management), Execution time

Related papers

Back to paper searchBrowse research topicsOriginal source
Task Scheduling on Multiprocessors for Power System Problems — Research Paper | ScholarLens