Distributed scheduler for high performance data-centric systems

Sushant Goel, Hema Sharda, David Taniar

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review


    Amount of data stored in enterprises are increasing rapidly. Volume of data stored in database is approaching to terabyte size. Response time is directly proportional to the amount of data in databases. Requirement of fast response time under these circumstances have motivated the research of Parallel Database Systems (PDS) during last decade. Despite distribution of data in PDS to various Processing Elements (PE), concurrency control algorithms uses centralized scheduling approach. This approach has inherent weakness, under heavy load conditions, such as - big lock table, more number of messages in the system, central overloaded scheduler. In this paper we distribute the scheduling responsibilities to the nodes where data is actually located. We also propose a new serializability criterion, Parallel Database Quasi-Serializability, to meet these requirements.

    Original languageEnglish
    Title of host publicationIEEE Region 10 Annual International Conference, Proceedings/TENCON
    PublisherIEEE, Institute of Electrical and Electronics Engineers
    Number of pages5
    Publication statusPublished - 2003
    EventIEEE Tencon (IEEE Region 10 Conference) 2003 - Bangalore, India
    Duration: 15 Oct 200317 Oct 2003
    https://ieeexplore.ieee.org/xpl/conhome/8975/proceeding?isnumber=28487 (Proceedings)


    ConferenceIEEE Tencon (IEEE Region 10 Conference) 2003
    Abbreviated titleTENCON 2003
    Internet address

    Cite this