Please use this identifier to cite or link to this item: http://www.repository.rmutt.ac.th/xmlui/handle/123456789/1305
Full metadata record
DC FieldValueLanguage
dc.contributor.authorA. Kumar1 and P.K. Yadav
dc.date.accessioned2014-02-11T06:51:55Z
dc.date.accessioned2020-09-24T04:46:03Z-
dc.date.available2014-02-11T06:51:55Z
dc.date.available2020-09-24T04:46:03Z-
dc.date.issued2014
dc.identifier.urihttp://www.repository.rmutt.ac.th/dspace/handle/123456789/1305-
dc.descriptionThe 15th International Conference of International Academy of Physical Sciencesen_US
dc.description.abstractThe term "Distributed Real-Time Computing System” is described whenever number of computers interconnected in some fashion such that a program or procedure utilizes this distributed but combined power and gets executed in Real Time. The term has different meanings with regard to different systems, because processors can be interconnected in many ways for various reasons. In its most general form, the word distribution implies that the processors are fixed in geographically separated locations. Occasionally, the term is also applied to an operating environment using multiple mini-computers not connected with each other with the help of physical communication lines but are connected through satellite. In a Distributed Real Time System (DRTS), the single communication channel share by all the processors for Inter-Processor Communication (IPC). A program whose execution is distributed among several processors in a distributed system has the total processing cost equal to the sum of processors costs and Inter Tasks Communication Cost (ITCC), which are function of the amount of data transmitted. An optimal assignment is a distribution of modules that has lowest total Execution Cost (EC). The model discussed in this paper provides an optimal solution for assigning a set of “m” tasks to a set of “n” processors where m >> n, in such a way that allocated load on all processors is balanced according to the relative speed. Distributed Real-Time System finds extensive applications in the faculties, where large amount of data is to be processed in relatively short period of time, or where Real-Time computations are required. Meteorology, Cryptography, Image Analysis, Signal Processing, Solar and Radar Surveillance, Simulation of VLSI circuits and Industrial process monitoring are areas of such applications. These applications require not only very fast computation speeds but also different strategies involving distributed task allocation systems. In such applications the quality of the output is proportional to the amount of Real-Time computations. In a Distributed Real-Time System the execution of a program may be distributed among several processing elements to reduce the overall system cost by taking the advantage of heterogeneous computational capabilities and other resources within the system. For the optimal utilization of processors systematic allocation of task is necessary.en_US
dc.language.isoenen_US
dc.publisherRajamangala University of Technology Thanyaburi. Faculty of Sciences and Technologyen_US
dc.subjectDistributed real time systemen_US
dc.subjectTask assignmenten_US
dc.subjectInter-task communication costen_US
dc.subjectExecution costen_US
dc.titleTasks management algorithm for distributed systemen_US
dc.typeOtheren_US
Appears in Collections:ประชุมวิชาการ (Proceedings - SCI)

Files in This Item:
File Description SizeFormat 
06-Tasks Management Algorithm.pdfTasks management algorithm for distributed system917.24 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.