BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-95-1555
       ENTRY:: September 11, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Real-time Database Experiences in Network Management
               Application
        TYPE:: Technical Report
      AUTHOR:: Kiriha, Yoshiaki
        DATE:: September 1995
       PAGES:: 63
    ABSTRACT:: This report discusses our experiences with real-time
               databases in the context of a network management system, in
               particular a MIB (Management Information Base)
               implementation. We propose an active and real-time MIB
               (ART-MIB) architecture that utilizes a real-time database
               system. The ART-MIB contains a variety of modules, such as
               transaction manager, task manager, and resource manager.
               Among the functionalities provided by ART-MIB, we focus on
               transaction scheduling within a memory based real-time
               database system. For the developed ART-MIB prototype, we have
               evaluated two typical real-time transaction scheduling
               algorithms: earliest deadline first (EDF) and highest value
               first (HVF). The main results of our performance comparison
               show that EDF outperforms HVF under a low load; however, HVF
               outperforms EDF in an overload situation. Furthermore, the
               fact that the performance crossover point closely depends on
               the magnitude of the scheduler queue, has been validated.
       NOTES:: [Adminitrivia V1/Prg/19950911]
         END:: STAN//CS-TR-95-1555