Suriayati Chuprat

Universiti Teknologi Malaysia, Bharu, Johor, Malaysia

Are you Suriayati Chuprat?

Claim your profile

Publications (5)0 Total impact

  • Suriayati Chuprat, Sanjoy Baruah
    [Show abstract] [Hide abstract]
    ABSTRACT: We extend the current state of the art in real-time divisible load theory (RT-DLT), by considering the problems of scheduling a real-time divisible job on computing clusters in which different processing nodes have different computing capabilities, as well as different costs associated with executing on them. We seek to minimize the cost of executing a job while also meeting its deadline.
    01/2011; 1:33-37.
  • Suriayati Chuprat, Shaharuddin Salleh, Steve Goddard
    [Show abstract] [Hide abstract]
    ABSTRACT: Current real-time application systems demand complex functionality and are increasingly coming to be implemented upon multiprocessor platforms, with complex synchronization, data-sharing and parallelism requirements. However, the formal models for representing real-time workloads have traditionally been designed in the context of uniprocessor environments; hence, they are often not able to accurately represent relevant features of multiprocessor real-time systems. Researchers have recently addressed this shortcoming by applying workload models from Divisible Load Theory (DLT) to real-time systems. The resulting theory, referred to as Real-time Divisible Load Theory (RT-DLT), holds great promise for modeling an emergent class of massively parallel real-time workloads. However, the theory needs strong formal foundations before it can be widely used for the design and analysis of real-time systems. In this paper, we briefly describe our current findings on RT-DLT and ongoing research efforts at extending this work to develop such formal foundations.
  • Source
  • Suriayati Chuprat, Shaharuddin Salleh, Sanjoy K. Baruah
    [Show abstract] [Hide abstract]
    ABSTRACT: Recent research in real-time divisible load theory (RT-DLT) has addressed the problem of distributing arbitrarily parallelizable real-time workloads among processors which become available at different instants. In prior work [1], we proposed a Linear Programming based formulation of the problem of computing the completion time of a real-time workload on a given collection of processors. In this paper, we show via extensive experimental evaluation that this LP based formulation significantly improves on the heuristic approximations [8,9] that were the only techniques previously known for solving these problems.
    Information Technology, 2008. ITSim 2008. International Symposium on; 09/2008
  • Suriayati Chuprat, Sanjoy K. Baruah
    Proceedings of the ISCA 20th International Conference on Parallel and Distributed Computing Systems, September 24-26, 2007, Las Vegas, Nevada, USA; 01/2007