• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 55,688
Next 10 →

Table 1. Real-time or Embedded Real-time

in A Review of Aspect-Oriented Software Development Techniques Used in Real-Time and Embedded Systems Software
by Pericles Leng Cheng, George Angelos Papadopoulos
"... In PAGE 9: ... Advantages of using aspect-oriented software development in such areas of real-time embedded system development have been identified by the authors especially in the scheduling, resource allocation and synchronization areas. In Table1 the authors describe an overview of the research done and whether that applies to real-time systems or embedded real-time systems. Additionally, in the Programming and OPerating Systems for Applications in Real-Time (POPART) project, research in being done in utilizing AOSD techniques in real-time systems.... ..."

Table 2: Tenets of Relational versus Embedded Real-Time Systems

in Embedded Real-Time and Database: How Do They Fit Together?
by Mayford B. Roark, Michael Bohler, Barbara L. Eldridge, Lockheed Martin

Table 1: Embedded Real-Time Software Synthesis Algorithm

in ABSTRACT Formal Synthesis and Code Generation of Embedded Real-Time Software
by Pao-ann Hsiung
"... In PAGE 3: ... The al- gorithm proposed here is thus intuitively divided into two phases corresponding to the two objectives. As shown in Table1 , given a set of TFCPNs CB BP CUBT CX CY BT CX BP B4C8 CX BNCC CX BNBY CX BNC5 CXBC BNAS CX B5BNCXBPBDBN BEBNBMBMBMBND2CV, a maximum bound on mem- ory AM, and a set of periods BX BP CUAP CX CY AP CX BEC6BNCX BPBDBN BEBNBMBMBMBND2CV, where AP CX is the period of BT CX , a software code is generated after the following two phases: 1. Quasi-Static Data Scheduling (QSDS): The basic concept here is to employ net decomposition such that firing choices that exists in a TFCPN are segregated into individual Conflict- Free (CF) components.... In PAGE 4: ... Our goal is to generate feasible scheduled code from the requirements. According to our proposed algorithm ( Table1 ), we apply quasi- static data scheduling and dynamic real-time scheduling to the given system. QSDS for BY BD : Since D8 BDBE and D8 BDBF are conflicting transitions, two CF components (CA BDBD and CA BDBE in Fig.... ..."

Table 1: Typical characteristics of Hard and Soft Real-Time Systems [Kop03] Characteristic Hard Real-Time Soft Real-Time

in Title: Vehicular Embedded Control Systems
by Ivica Crnkovic, Johan Fredriksson, Hans Hansson, Jörgen Hansson, Joel Huselius, Mikael Nolin, Thomas Nolte, Christer Norström, Kristian S, Ra Tešanović, Mikael Åkerholm, Martin Törngren, Ola Larses, Kristian S, Johan Fredriksson, Christer Norström, Mikael Åkerholm

Table 2.9: Real-time and embedded operating systems supported by investigated embedded database systems.

in Embedded Databases for Embedded Real-Time Systems: A Component-Based Approach
by Aleksandra Tesanovic, Dag Nyström, Jörgen Hansson, Christer Norström 2002
Cited by 8

Table V. TABLE V LEARNING OUTCOMES FOR PERFORMANCE ENGINEERING OF REAL-TIME AND EMBEDDED SYSTEMS COURSE

in Session T1A Thinking Inside the Box: A Multi-Disciplinary Real-Time and Embedded Systems Course Sequence
by Abstract Small

Table 1 Learning Outcomes for Real-Time and Embedded Systems Course Knowledge

in Session 2. Special Session on Embedded Systems 1, 9:35–10:30 Introduction to Special Session, Kenneth Ricks................................................................................. 5
by North Carolina State U, Jim Conrad Unc–charlotte, Edward F. Gehringer, Workshop Organizer, Kenny Ricks, Roy S. Czernikowski, James R. Vallino 2005
"... In PAGE 14: ...Integration Financial textbook unlike MIPS inexpensive boards intuitive software parallelism multiple courses breadboard access DSP Table1 . Summary of goals 3.... In PAGE 33: ... Each track consists of eight areas and all areas store exactly 512 bytes of data. Table1 specifies the numbering scheme used to identify actual locations on the device. Figure 2 shows both sides of a platter.... In PAGE 33: ... Figure 2 shows both sides of a platter. Table1 . Basic Hardware Components of LMS Storage Device Components ID Numbering Scheme for the Component 3 cylinders 0, 1, 2 (independent of platter surface) 4 tracks per cylinders 0, 1, 2, 3 (0/1 1st platter amp; 2/3 2nd platter) 8 areas per track 0, 1, 2, 3, 4, 5, 6, 7 (same data each area) Figure 2.... In PAGE 42: ... c4 Output from memory location 04 44 Load input register from memory location 4 01 Add I (01) to input register 64 Save output register in memory location 04 c4 Output from memory location 04 41 load input register from memory location 01 22 Add from memory location 02 61 Save output register to memory location 02 aa Jump if last calculation result was zero to 0a 80 Jump to memory location 00(+1) e0 Halt execution Table 2. Program memory content for program 1 00 zero (not used) 19 Hex for character count in alphabet ff Twos complement negative one fe Twos complement negative two (not used) 41 ASCII code for letter A 41 (not used) 41 quot; 00 quot; 00 quot; 00 quot; Table1 . Data memory content for program 1 Page 42 Workshop on Computer Architecture Education... ..."

Table 3 Learning Outcomes for Performance Engineering of Real-Time and Embedded Systems Course

in Session 2. Special Session on Embedded Systems 1, 9:35–10:30 Introduction to Special Session, Kenneth Ricks................................................................................. 5
by North Carolina State U, Jim Conrad Unc–charlotte, Edward F. Gehringer, Workshop Organizer, Kenny Ricks, Roy S. Czernikowski, James R. Vallino 2005
"... In PAGE 35: ... It is of fixed size (one area) and cannot be expanded. Table3 shows the values stored in the LIST for several files. The location of the initial data in the file is specified in the Area Start Location as a (cylinder, platter, area) location.... In PAGE 35: ... This is denoted as lt;blank gt; in Table 3. Table3 . LIST Structure for the Disk File Name Size (Bytes) Area Start Creation Date ALPHA.... In PAGE 35: .... . . 237 999 Table3 shows that the LIST entry for a file identifies only the first area assigned to it. The rest of the file location information is stored in the AUL.... In PAGE 43: ... Program memory content for program 3 06 column (size of triangle) 03 row (not used in program) 00 column step 00 row step ff negative one (allows decrementing ) 00 zero 2a symbol quot;* quot; 0d new line Table 5. Data memory content for program 3 20 Space 20 Space 48 H 45 E 4c L 4c L 4f O 20 Space 57 W 4f O 52 R 4c L 44 D 21 ! 0d New Line Table3 . Data memory content for program 2 June 5, 2005 Workshop on Computer Architecture Education... ..."

Table 2: Choice of implementation architecture for hard and soft real-time systems. Since many applications contain soft real-time functions and hard real-time functions in parallel, it can be economical to partition the system into a hard real-time partition and a soft real-time partition with a gateway

in unknown title
by unknown authors
"... In PAGE 9: ... Furthermore, it does not lead to composable design. From the economic viewpoint it is important to make the right choice about the implementation architecture ( Table2 ) for a soft and hard real-time application.... ..."

Table 1. Hard real-time tasks

in unknown title
by unknown authors 1998
"... In PAGE 5: ...4. Example Table1 lists a hard real-time task set. The latest deadline of the hard real-time task is 108.... ..."
Cited by 1
Next 10 →
Results 1 - 10 of 55,688
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University