On non-preemptive scheduling of recurring tasks using inserted idle times

Journal article

Peer reviewed

R. R Howell and M. K Venkatrao

Information and computation, Vol.117(1), pp.50-62

1995

Abstract

Algorithmics. Computability. Computer arithmetics

Applied sciences

Computer science; control theory; systems

Computer systems and distributed systems. User interface

Exact sciences and technology

Software

Theoretical computing

4 Record Views

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Citation topics: 4 Electrical Engineering, Electronics & Computer Science; 4.46 Distributed & Real Time Computing; 4.46.1107 Real-Time Systems
Web Of Science research areas: Computer Science, Theory & Methods; Mathematics, Applied
ESI research areas: Computer Science

This output has contributed to the advancement of the following goals:

Source: InCites

Title: On non-preemptive scheduling of recurring tasks using inserted idle times
Creators: R. R Howell - Kansas State University
M. K Venkatrao - Kansas State University
Publication Details: Information and computation, Vol.117(1), pp.50-62
Publisher: Elsevier
Academic Unit: Miller School of Medicine; Miller School of Medicine Administration; UMMG Department of Pediatrics
Language: English
Resource Type: Journal article
Record Identifier: 991031739786702976