Durra: A Task-Level Description Language Use's Manual

Barbacci, Mario R.; Doubleday, Dennis L.; Weinstock, Charles B.

doi:10.21236/ada223761

Cited by 7 publications

(7 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The X support is required in the latter case because a dedicated window must handle the monitor's user interface. Durra: A Task-Level Description Language User's Manual [5] (hereafter referred to as the Durra User's Manual) describes in detail the start-up process in the Unix environment. As shown in Figure 3, the monitor exchanges information with the master executive through a remote procedure call (rpc) interface, just as Durra application tasks do.…”

Section: Implementation Of the Application Debugger/monitormentioning

confidence: 99%

The Durra Application Debugger/Monitor

Doubleday

1989

Self Cite

View full text Add to dashboard Cite

Section: Implementation Of the Application Debugger/monitormentioning

confidence: 99%

The Durra Application Debugger/Monitor

Doubleday

1989

Self Cite

View full text Add to dashboard Cite

“…Intermodule communication is specified by the intermodule data-flow pattern and associated bandwidths, and can be represented graphically. Examples of graphical representation languages include SIGNAL [4], and other research work at Carnegie Mellon [2,3]. A graphical representation includes:…”

Section: Introductionmentioning

confidence: 99%

Parallel Algorithm For Network Traffic Scheduling In Application-Specific Architectures

Bianchini

Shen

1988

SPIE Proceedings

View full text Add to dashboard Cite

For many application -specific and mission -oriented multiple processor systems, the interprocessor communication is deterministic and can be specified at system inception. This specification can be automatically mapped onto a physical system using a network traffic scheduler. An iterative network traffic scheduler is presented which, given the arbitrary topology of the communication network, translates the deterministic communication into a network traffic routing pattern. Previous work has shown the existence of a network traffic scheduling algorithm based on a fluid -flow model that converges to an optimal solution. However, this algorithm assumes an external host that performs centralized scheduling. This paper presents a parallel version of the algorithm which can be executed in a parallel fashion by the network switching nodes themselves without requiring an external host. Hence, using such an algorithm a communication network can perform self scheduling of interprocessor traffic. Furthermore, with the self -scheduling capability, a network will be able to perform traffic routing and scheduling concurrently and on -line network reconfiguration.ABSTRACT For many application-specific and mission-oriented multiple processor systems, the interprocessor communication is deterministic and can be specified at system inception. This specification can be automatically mapped onto a physical system using a network traffic scheduler. An iterative network traffic scheduler is presented which, given the arbitrary topology of the communication network, translates the deterministic communication into a network traffic routing pattern. Previous work has shown the existence of a network traffic scheduling algorithm based on a fluid-flow model that converges to an optimal solution. However, this algorithm assumes an external host that performs centralized scheduling. This paper presents a parallel version of the algorithm which can be executed in a parallel fashion by the network switching nodes themselves without requiring an external host. Hence, using such an algorithm a communication network can perform self scheduling of interprocessor traffic. Furthermore, with the self-scheduling capability, a network will be able to perform traffic routing and scheduling concurrently and on-line network reconfiguration. 116 / SPIE Vol. 880 High Speed Computing (1988) Downloaded From: http://proceedings.spiedigitallibrary.org/ on 06/20/2016 Terms of Use: http://spiedigitallibrary.org/ss/TermsOfUse.aspxapproach and the use of automated design tools ensures that these special -purpose systems can be cost -effectively designed and implemented.This methodology employs an architecture compilation procedure which performs the mapping from the target architecture, specifying the application, to a host architecture which is the customizable physical system. A key component of this compilation procedure is the task of scheduling and routing of interprocessor traffic in the communication network. The network traffic scheduler functions as the "...

show abstract

“…We have an initial design of such a description language [1], a compiler for it, and a simulator that takes task descriptions as input. A task description (see Figure 1) contains information about four aspects of a task: (1) its interlace to other tasks (ports) and to the scheduler (signals); (2) its functional and timing behavior, (3) its attributes, and (4) its internal structure, thereby allowing for hierarchical task descriptions.…”

mentioning

confidence: 99%

“…A task description (see Figure 1) contains information about four aspects of a task: (1) its interlace to other tasks (ports) and to the scheduler (signals); (2) its functional and timing behavior, (3) its attributes, and (4) its internal structure, thereby allowing for hierarchical task descriptions. Reference [1] contains a more complete explanation of these and other features of the language. In this paper we focus on only one aspect: the information appearing in the behavior part of a task description.…”

mentioning

confidence: 99%

Specifying functional and timing behavior for real-time applications

Barbacci

Wing

1987

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We present a notation and a methodology for specifying the functional and timing behavior of real-time applications for a heterogeneous machine. In our methodology we build upon well-defined, though isolated, pieces of previous work: Larch and Real Time Logic. In our notation, we strive to keep separate the functional specification from the timing specification so that a task's functionality can be understood independent of its timing behavior. We show that while there is a clean separation of concerns between these two specifications, the semantics of both pieces as well as their combination are simple. Comments

show abstract

Durra: A Task-Level Description Language Use's Manual

Abstract: The ideas and findings in this report should not be construed as an official DoD position. It is published in the interest of scientific and technical information exchange.-Review and Approval This report has been reviewed and is approved for publication. FOR THE COMMANDER

Cited by 7 publications

References 0 publications

The Durra Application Debugger/Monitor

The Durra Application Debugger/Monitor

Parallel Algorithm For Network Traffic Scheduling In Application-Specific Architectures

Specifying functional and timing behavior for real-time applications

Contact Info

Product

Resources

About