ridm@nrct.go.th   ระบบคลังข้อมูลงานวิจัยไทย   รายการโปรดที่คุณเลือกไว้

Task assignment in parallel processor systems

หน่วยงาน Edinburgh Research Archive, United Kingdom

รายละเอียด

ชื่อเรื่อง : Task assignment in parallel processor systems
นักวิจัย : Manoharan, Sathiamoorthy
คำค้น : Parallel processing , Task analysis
หน่วยงาน : Edinburgh Research Archive, United Kingdom
ผู้ร่วมงาน : Topham, Nigel , Ibbett, Roland , University of Edinburgh , Overseas Research Students Awards Scheme (ORSAS)
ปีพิมพ์ : 2536
อ้างอิง : http://hdl.handle.net/1842/6568
ที่มา : -
ความเชี่ยวชาญ : -
ความสัมพันธ์ : Sathiamoorthy Manoharan. A taxonomy for assignment in parallel processor systems. In Proceedings of the 5th Annual European Computer Conference: CompEuro '91, pages 143-147, Bologna, Italy, May 13-16, 1991. IEEE Computer Society Press. , Sathiamoorthy Manoharan. Genesis: A generic simulation subsystem for parallel architectures. In Proceedings of the 6th Annual European Computer Conference: CompEuro '92, The Hague, The Netherlands, May 4-8, 1992. IEEE Computer Society Press. , Sathiamoorthy Manoharan and Nigel P Topham. A general bound on schedule length for independent tasks. Parallel Computing, 16(1):69- 73, November 1990. , Sathiamoorthy Manoharan and Peter Thanisch. Assigning dependency graphs onto processor networks. Parallel Computing, 17(1):63-73, April 1991.
ขอบเขตของเนื้อหา : -
บทคัดย่อ/คำอธิบาย :

A generic object-oriented simulation platform is developed in order to conduct experiments on the performance of assignment schemes. The simulation platform, called Genesis, is generic in the sense that it can model the key parameters that describe a parallel system: the architecture, the program, the assignment scheme and the message routing strategy. Genesis uses as its basis a sound architectural representation scheme developed in the thesis. The thesis reports results from a number of experiments assessing the performance of assignment schemes using Genesis. The comparison results indicate that the new assignment scheme proposed in this thesis is a promising alternative to the work-greedy assignment schemes. The proposed scheme has a time-complexity less than those of the work-greedy schemes and achieves an average performance better than, or comparable to, those of the work-greedy schemes. To generate an assignment, some parameters describing the program model will be required. In many cases, accurate estimation of these parameters is hard. It is thought that inaccuracies in the estimation would lead to poor assignments. The thesis investigates this speculation and presents experimental evidence that shows such inaccuracies do not greatly affect the quality of the assignments.

บรรณานุกรม :
Manoharan, Sathiamoorthy . (2536). Task assignment in parallel processor systems.
    กรุงเทพมหานคร : Edinburgh Research Archive, United Kingdom .
Manoharan, Sathiamoorthy . 2536. "Task assignment in parallel processor systems".
    กรุงเทพมหานคร : Edinburgh Research Archive, United Kingdom .
Manoharan, Sathiamoorthy . "Task assignment in parallel processor systems."
    กรุงเทพมหานคร : Edinburgh Research Archive, United Kingdom , 2536. Print.
Manoharan, Sathiamoorthy . Task assignment in parallel processor systems. กรุงเทพมหานคร : Edinburgh Research Archive, United Kingdom ; 2536.