Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Rate-monotonic scheduling for hard-real-time systems

Article Abstract:

The deterministic scheduling of tasks in real-time computing systems are discussed. Specifically, rate-monotonic algorithms for scheduling periodic and non-periodic tasks as well as synchronized and independent jobs with restricted and arbitrary deadlines on uniprocessor and multiprocessor systems with fixed and dynamic priorities are presented. Such algorithms provide a balanced compromise between flexibility and predictability of scheduling decisions.

Author: Bertossi, Alan A., Fusiello, Andrea
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Real time systems, Real-time systems, Fault tolerant computer systems, Fault tolerance (Computers)

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Task scheduling with and without communication delays: a unified approach

Article Abstract:

An approximation algorithm is proposed for solving the problem of scheduling directed acyclic task graphs on an unbounded number of processors. The algorithm computes a schedule with respect to the number of stages and the maximum number of edges between any two stages of a graph. It is capable of generating optimal schedules in task graphs without communication cost and in in-tree and out-tree graphs with small communication cost.

Author: Krishnamoorthy, Venkatesh, Efe, Kemal
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Multiprocessing, Time-sharing computer systems, Time sharing computer systems

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Weighted flow time bounds for scheduling identical processors

Article Abstract:

The identical parallel processor weighted flow time problem is analyzed. The scheduling problem assumes n scheduled jobs for m identical processors in parallel and aims to optimize weighted flow time. Such a parallel processor system is shown as an optimal combination with job priority differences for scheduling systems. In addition, job flow time applications based on related lower bounds can be easily calculated.

Author: Webster, Scott
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Scheduling (Management)
Similar abstracts:
  • Abstracts: Determining dominant wind directions. Incorporating inventory and routing costs in strategic location models. Lot streaming for quality control in two-stage batch production
  • Abstracts: Belgian utilities create company for Nordic area. Road test; as VW cranks out more models, they start to look alike
  • Abstracts: Basics, not guanxi, should drive China deals. China's business world can get in your face. Helping expats survive China: experts urge support systems for staff, families, to avert problems
  • Abstracts: A model of clinker capacity expansion. Joint planning of combined heat and power and electric power systems: an efficient model formulation
  • Abstracts: Strategic facility location: a review. Fitting rectilinear polygonal curves to a set of points in the plane. Competitive location with rectilinear distances
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.