IBM®
Skip to main content
    Country/region [change]    Terms of use
 
 
 
    Home    Products    Services & solutions    Support & downloads    My account    

IBM Systems Journal
Real-Time and Event-Based Systems   Volume 47, Number 2, 2008
Table of contents: HTMLPDF This article: HTMLPDF   Copyright info

Toward scalable real-time messaging - References

 by D. Bauer,
L. Garcés-Erice,
S. Rooney,
and P. Scotton
Cited references

  1. C. L. Liu and J. W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-time Environment,” Journal of the ACM 20, No. 1, 46–61 (1973).
  2. P. Dibble et al., “JSR 1: Real-time Specification for Java,” (July 2006), http://jcp.org/en/jsr/detail?id=1.
  3. D. F. Bacon, P. Cheng, and V. Rajan, “The Metronome: A Simpler Approach to Garbage Collection in Real-time Systems,” in Proceedings of the OTM Workshops, Lecture Notes in Computer Science, Volume 2889, R. Meersman and Z. Tari, Editors, (November 2003), pp. 466–478.
  4. G. Bernat, A. Colin, and S. M. Petters, “WCET Analysis of Probabilistic Hard Real-time Systems,” Proceedings of the Real-Time Systems Symposium (RTSS), (December 2002), pp. 279–288.
  5. Websphere MQ, IBM Corporation, http://www.ibm.com/software/integration/mqfamily/.
  6. MQ Telemetry Transport, http://www.mqtt.org.
  7. G. Banavar, T. D. Chandra, R. E. Strom, and D. C. Sturman, “A Case for Message-Oriented Middleware,” Proceedings of the 13th International Symposium on Distributed Computing, Springer-Verlag, London (1999), pp. 1–18.
  8. R. Strom, C. Dorai, G. Buttner, and Y. Li, “Smile: Distributed Middleware for Event Stream Processing,” Proceedings of the 6th International Conference on Information Processing in Sensor Networks (IPSN '07), ACM Press, New York (2007), pp. 553–554.
  9. CORBA Notification Service Specification, Object Management Group Publication (August 2002).
  10. T. H. Harrison, D. L. Levine, and D. C. Schmidt, “The Design and Performance of a Real-time CORBA Event Service,” Proceedings of OOPSLA '97, ACM Press, New York (October 1997), pp. 184–200.
  11. Data Distribution Service for Real-time Systems, version 1.1, Object Management Group Publication (May 2004).
  12. S. Rooney, D. Bauer, and R. Deydier, “A Federated Peer-to-Peer Network Game Architecture,” IEEE Communications 42, No. 5, 114–122 (2004).
  13. A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queueing Algorithm,” Symposium Proceedings on Communications Architectures and Protocols, SIGCOMM '89, ACM Press, New York (1989), pp. 1–12.
  14. R. Jain, The Art of Computer Systems Performance Analysis, Wiley Professional Computing, Hoboken, NJ (1991).
  15. J. D. C. Little, “A Proof for the Queuing Formula: L = λ w,” Operations Research 9, No. 3, 383–387 (1961).
  16. M. M. Michael and M. L. Scott, “Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms,” Proceedings of the 15th ACM Symposium on Principles of Distributed Computing, ACM Press, New York (1996), pp. 267–275.
  17. L. Lamport, “How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs,” IEEE Transactions on Computers 28, No. 9, 690–691 (1979).
  18. S. Rooney, D. Bauer, and L. Garcés-Erice, “Building a Practical Event-scheduler for a Multi-core Architecture,” IBM Research Technical Report RZ 3695 (September 2007), http://domino.watson.ibm.com/library/CyberDig.nsf/1e4115aea78b6e7c85256b360066f0d4/
    f07af02cd3e3ebe7852574440049ebb3?OpenDocument    .
  19. W. Wu, M. Crawford, and M. Bowden, “The Performance Analysis of Linux Networking—Packet Receiving,” Computer Communications 30, No. 5, 1044–1057, 2007.


    About IBM    Privacy    Contact