• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 232
  • 36
  • 14
  • 9
  • 7
  • 6
  • Tagged with
  • 322
  • 322
  • 322
  • 322
  • 159
  • 112
  • 63
  • 49
  • 34
  • 34
  • 32
  • 28
  • 27
  • 26
  • 25
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Design and analysis of hard real-time systems

Zhu, Jiang 16 November 1993 (has links)
First, we study hard real-time scheduling problems where each task is defined by a four tuple (r, c, p, d): r being its release time, c computation time, p period, and d deadline. The question is whether all tasks can meet their deadlines on one processor. If not, how many processors are needed? For the one-processor problem, we prove two sufficient conditions for a (restricted) periodic task set to meet deadlines. The two conditions can be applied to both preemptive and non-preemptive scheduling, in sharp contrast to earlier results. If a periodic task set can meet deadlines under any algorithm which does not idle the processor as long as there are tasks ready to execute, it must satisfy our second condition. We also prove a necessary condition for a periodic task set to meet deadlines under any scheduling algorithm. We present a method for transforming a sporadic task to an equivalent periodic task. The transformation method is optimal with respect to non-preemptive scheduling. With this method, all results on scheduling periodic task sets can be applied to sets of both periodic and sporadic tasks. For the scheduling problem in distributed memory systems, we propose various heuristic algorithms which try to use as few processors as possible to meet deadlines. Although our algorithms are non-preemptive, our simulation results show that they can outperform the heuristic algorithms based on the famous preemptive rate monotonic algorithm in terms of the number of used processors and processor utilization rate. Second, we describe a hard real-time software development environment, called HaRTS, which consists of a design tool and a scheduling tool. The design tool supports a hierarchical design diagram which combines the control and data flow of a hard real-time application. The design diagram is quite intuitive, and yet it can be automatically translated into Ada��� code and analyzed for scheduleability. The scheduling tool schedules precedence-constrained periodic task sets and simulates the task execution with highly animated user interfaces, which goes beyond the traditional way of examining a schedule as a static Gantt chart. / Graduation date: 1994
2

Real-time engagement area dvelopment program (READ-Pro) /

Burger, Joseph. January 2002 (has links) (PDF)
Thesis (M.S.)--Naval Postgraduate School, 2002. / Thesis advisor(s):Gordon Bradley, Saverio Manago. Includes bibliographical references (p. 87). Also available online.
3

Integration of hard real-time schedulers

Wang, Weirong 28 August 2008 (has links)
Not available / text
4

Development and application of a software monitor for a realtime system

Peil, Sally Jean 12 1900 (has links)
No description available.
5

Distributing real time data from a multi-node large scale contact center using CORBA

Goggins, Joe. January 2007 (has links) (PDF)
Thesis (M.S.S.I.S.)--Regis University, Denver, Colo., 2007. / Title from PDF title page (viewed on Nov. 02, 2007). Includes bibliographical references.
6

Specification and compositional verification of real time systems /

Hooman, Jozef. January 1991 (has links)
Univ. of Technology, Diss--Eindhoven.
7

The virtual time function and rate-based schedulers for real-time communications over packet networks /

Devadason, Tarith Navendran. January 2007 (has links)
Thesis (Ph.D.)--University of Western Australia, 2007. / "WATRI (Western Australian Telecommunications Research Institute)"
8

Integration of hard real-time schedulers

Wang, Weirong. Mok, Aloysius Ka-Lau, January 2004 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2004. / Supervisor: Aloysius K. Mok. Vita. Includes bibliographical references.
9

A real time control program

Chapat, Christophe. January 1983 (has links)
Thesis (M.S.)--University of Wisconsin--Madison, 1983. / Typescript. eContent provider-neutral record in process. Description based on print version record.
10

An automation-based design methodolgy [sic] for distributed, hard real-time systems /

Puchol, Carlos Miguel. January 1998 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 1998. / Vita. Includes bibliographical references (leaves 163-167). Available also in a digital version from Dissertation Abstracts.

Page generated in 0.1453 seconds