There is a growing interest in using the object paradigm for developing real-time software. We believe that an approach that integrates the advancements in both object modeling and design methods, and real-time scheduling theory is the key to successful use of object technology for real-time software. Surprisingly many past approaches to integrate the two either restrict the object models, or do not allow sophisticated schedulability analysis tech-niques. In this paper we show how schedulability analysis can be integrated with object-oriented design. More specifically, we show how fixed priority scheduling theory can be applied to designs developed using UML-RT, a specialization of UML for real-time software. We show how a design model built with active objects, and asynchronous and synchronous message passing (as is the case in UML-RT) can be implemented such that the implementation can be analyzed for schedulability. We then develop the response time analysis for such im-plementations, using which a designer can quickly evaluate the impact of various implementation decisions on schedulability. In conjunction with automatic code-generation, we believe that this will greatly streamline the design and development of real-time software. Based on our interactions with some of the leading commercial vendors, we expect that the results of this work will be integrated with commercial tools in the near future. 1.
|
4363
|
Elements of Information Theory
– Cover, Thomas
- 1991
|
|
3214
|
C4.5: Programs for Machine Learning
– Quinlan
- 1993
|
|
2438
|
Classification and Regression Trees
– Breiman, Friedman, et al.
- 1984
|
|
2172
|
Optimization by simulated annealing
– Kirkpatrick, Gelatt, et al.
- 1983
|
|
2168
|
Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment
– Liu, Layland
- 1973
|
|
2113
|
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications, 2001
– Stoica, Morris, et al.
|
|
2103
|
A tutorial in hidden Markov models and selected applications in speech recognition
– Rabiner
- 1989
|
|
1889
|
Matrix Analysis
– Horn, Johnson
- 1985
|
|
1749
|
A scalable content-addressable network
– Ratnasamy, Francis, et al.
- 2001
|
|
1650
|
R-trees: A dynamic index structure for spatial searching
– Guttman
- 1984
|
|
1631
|
The anatomy of a large-scale hypertextual web search engine
– Brin, Page
- 1998
|
|
1606
|
Fast algorithms for mining association rules
– Agrawal, Srikant
- 1994
|
|
1523
|
Authoritative sources in a hyperlinked environment
– Kleinberg
- 1999
|
|
1464
|
The Unified Model-ing Language User Guide
– Booch, Jacobson, et al.
- 1999
|
|
1448
|
Mining association rules between sets of items in large databases
– Agrawal, Imielinski, et al.
- 1993
|
|
1410
|
Convex Analysis
– Rockafellar
- 1970
|
|
1097
|
Vector Quantization and Signal Compression
– Gersho, Gray
- 1992
|
|
981
|
An algorithm for suffix stripping
– Porter
- 1997
|
|
964
|
Normalized cuts and image segmentation
– Shi, Malik
- 2000
|
|
957
|
The capacity of wireless networks
– Gupta, Kumar
- 2000
|
|
897
|
Random oracles are practical: A paradigm for designing efficient protocols
– Bellare, Rogaway
- 1993
|
|
887
|
Reinforcement learning: A survey
– Kaelbling, Littman, et al.
- 1996
|
|
811
|
Network flows: theory, algorithms, and applications
– Ahuja, Magnanti, et al.
- 1993
|
|
787
|
On the evolution of random graphs
– ERDÖS, A
- 1960
|
|
735
|
The Physiology of the Grid: An Open Grid Services Architecture for Distributed Systems Integration, Global Grid Forum
– Foster, Kesselman, et al.
- 2002
|
|
718
|
Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems
– Rowstron, Druschel
- 2001
|
|
704
|
Curves and Surfaces for Computer Aided Geometric Design, 4th ed.Academic
– Farin
- 1997
|
|
687
|
Space/time trade-offs in hash coding with allowable errors
– Bloom
- 1970
|
|
666
|
The art of computer systems performance analysis
– Jain
- 1991
|
|
640
|
ªPriority Inheritance Protocols: An Approach to Real-Time Synchronization,º
– Sha, Rajkumar, et al.
- 1990
|
|
631
|
The Unified Modeling Language, Reference Manual
– Rumbaugh, Jacobson, et al.
- 1999
|
|
578
|
Efficient software-based fault isolation
– Wahbe, Lucco, et al.
- 1993
|
|
531
|
Content-based image retrieval at the end of the early years
– Smeulders, Worring, et al.
- 2000
|
|
509
|
Image coding using wavelet transform
– Antonini, Barlaud, et al.
- 1992
|
|
500
|
Bayesian Data Analysis
– Gelman, Carlin, et al.
- 1995
|
|
491
|
The MD5 message-digest algorithm
– Rivest
- 1992
|
|
490
|
Generalization as search
– MITCHELL
- 1982
|
|
476
|
OSPF Version 2
– Moy
- 1998
|
|
439
|
The rate monotonic scheduling algorithm-Exact characterization and average case behavior
– Lehoczky, Sha, et al.
- 1989
|
|
418
|
GPS-less low-cost outdoor localization for very small devices
– Bulusu, Heidemann, et al.
- 2000
|
|
416
|
A re-examination of text categorization methods
– Yang, Liu
- 1999
|
|
410
|
Real-Time ObjectOriented Modeling
– Selic, Gullekson, et al.
- 1994
|
|
403
|
Numerical Recipes in C
– Press, Teukolsky, et al.
- 1992
|
|
391
|
A space economical suffix tree construction algorithm
– McCreight
- 1976
|
|
389
|
The High Performance Fortran Handbook
– Koelbel, Loveman, et al.
- 1994
|
|
379
|
Visual Information Seeking: Tight Coupling of Dynamic Query Filters with Starfield Displays
– Ahlberg, Shneiderman
|
|
377
|
Mobility increases the capacity of ad hoc wireless networks
– Grossglauser, Tse
- 2002
|
|
368
|
Access path selection in a relational database management system
– Selinger, Astrahan, et al.
- 1979
|
|
363
|
Learning the parts of objects by nonnegative matrix factorization
– Lee, Seung
- 1999
|
|
356
|
Rules of Encounter: Designing Conventions for Automated Negotiation among Computers
– Rosenschein, Zlotkin
- 1994
|
