This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Enhancing the Schedulability of Real-Time Heterogeneous Networks of Workstations (NOWs)
November 2009 (vol. 20 no. 11)
pp. 1586-1599
ASCII Text
x 
 
Nitin Auluck, Dharma P. Agrawal, "Enhancing the Schedulability of Real-Time Heterogeneous Networks of Workstations (NOWs)," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 11, pp. 1586-1599, November, 2009.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2008.247,
author = {Nitin Auluck and Dharma P. Agrawal},
title = {Enhancing the Schedulability of Real-Time Heterogeneous Networks of Workstations (NOWs)},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {20},
number = {11},
issn = {1045-9219},
year = {2009},
pages = {1586-1599},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.247},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Enhancing the Schedulability of Real-Time Heterogeneous Networks of Workstations (NOWs)
IS - 11
SN - 1045-9219
SP1586
EP1599
EPD - 1586-1599
A1 - Nitin Auluck,
A1 - Dharma P. Agrawal,
PY - 2009
KW - Favorite predecessor
KW - heterogeneous network of workstations
KW - periodic tasks
KW - precedence constraints
KW - real-time scheduling
KW - subtask compaction
KW - subtask duplication.
VL - 20
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
Nitin Auluck, Quincy University, Quincy
Dharma P. Agrawal, University of Cincinnati, Cincinnati
This paper proposes a Real-Time Duplication-Based Algorithm (RT-DBA) for scheduling precedence-related periodic tasks with hard deadlines on networks of workstations (NOWs). We have utilized selective subtask duplication that enables some tasks to have earlier start times, which enables additional tasks (and, hence, task sets) to finish before their deadlines, thereby increasing the schedulability of a real-time application. We strongly believe that duplication can be used as a tool for obtaining a better quality of service (QoS) from the real-time heterogeneous system, and this is our major contribution. We have taken both the computation and the communication heterogeneities into account while modeling such a system. Both data and control dependencies between the tasks have also been considered. Our algorithm exhibits scalability, fully exploits the underlying parallelism, and is capable of scheduling an application, even if the available number of processors is less than the required number of processors. Based on extensive simulation studies, we observe that RT-DBA offers an enhanced success ratio as compared to other scheduling schemes when communication is a dominant factor.

[1] J. Liu, Real-Time Systems. Prentice Hall, 2000, ISBN: 0130996513.
[2] P. Pop, “Analysis and Synthesis of Communication Intensive Heterogeneous Real-Time Systems,” PhD thesis, Dept. of Computer and Information Science, Linkoping Univ., 2003.
[3] X. Qin and H. Jiang, “Improving the Performance of Communication Intensive Parallel Applications Executing on Clusters,” Proc. IEEE Int'l Conf. Cluster Computing (CLUSTER '04), p. 493, Sept. 2004.
[4] S. Baruah, “Scheduling Periodic Tasks on Uniform Multiprocessors,” Proc. 12th Euromicro Conf. Real-Time Systems (Euromicro RTS '00), pp. 7-14, June 2000.
[5] S. Baruah and J. Goossens, “Rate-Monotonic Scheduling on Uniform Multiprocessors,” Technical Report 472, ULB, 2002.
[6] D.T. Peng and K.G. Shin, “Static Allocation of Periodic Tasks with Precedence Constraints in Distributed Real-Time Systems,” Proc. Ninth Int'l Conf. Distributed Computing Systems (ICDCS'89), pp. 190-195, June 1989.
[7] B. Andersson, S. Baruah, and J. Jonsson, “Static Priority Scheduling on Multiprocessors,” Proc. 22nd IEEE Real-Time Systems Symp. (RTSS '01), pp. 193-202, Dec. 2001.
[8] G. Manimaran and C. Siva Ram Murthy, “An Efficient Dynamic Scheduling Algorithm for Multi-Processor Real-Time Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 3, pp. 312-319, Mar. 1998.
[9] H. Chetto, M. Silly, and T. Bouchentouf, “Dynamic Scheduling of Real-time Tasks under Precedence Constraints,” J. Real-Time Systems, vol. 2, no. 3, pp. 181-194, 1990.
[10] J. Stankovic, M. Spuri, M. Natale, and G. Buttazzo, “Implications of Classical Scheduling Results for Real-Time Systems,” Computer, vol. 28, no. 6, pp. 16-25, June 1995.
[11] C. Liu and J. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[12] K. Ramamritham, “Allocation and Scheduling of Precedence-Related Periodic Tasks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 4, pp. 412-420, Apr. 1995.
[13] S.T. Cheng, S.I. Hwang, and A.K. Agrawala, “Schedulability-Oriented Replication of Periodic Tasks in Distributed Real-Time Systems,” Proc. 15th Int'l Conf. Distributed Computing Systems (ICDCS '95), pp. 196-203, 1995.
[14] K. Jeffay, D. Stanat, and C. Martel, “On Non-Preemptive Scheduling of Periodic and Sporadic Tasks,” Proc. 12th IEEE Real-Time Systems Symp. (RTSS '91), pp. 129-139, Dec. 1991.
[15] J.Y. Chung, J.W.S. Liu, and K.J. Lin, “Scheduling Periodic Jobs That Allow Imprecise Results,” IEEE Trans. Computers, vol. 39, no. 9, pp. 1156-1174, Sept. 1990.
[16] T. Abdelzaher and K. Shin, “Combined Task and Message Scheduling in Distributed Real-Time Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 11, pp. 1179-1191, Nov. 1999.
[17] H. Kaneko, J. Stankovic, S. Sen, and K. Ramamritham, “Integrated Scheduling of Multimedia and Hard Real-Time Tasks,” Proc. 17th IEEE Real-Time Systems Symp. (RTSS '96), pp. 206-217, Dec. 1996.
[18] M. Natale and J. Stankovic, “Dynamic End-to-End Guarantees in Distributed Real-Time Systems,” Proc. 15th IEEE Real-Time Systems Symp. (RTSS '94), pp. 216-227, 1994.
[19] G. Fohler and K. Ramamritham, “Static Scheduling of Pipelined Periodic Tasks in Distributed Real-Time Systems,” Proc. Ninth Euromicro Workshop Real-Time Systems (Euromicro RTS '97), pp.128-135, June 1997.
[20] T.F. Abdelzaher and K.G. Shin, “Period-Based Partitioning and Assignment for Large Real-Time Applications,” IEEE Trans. Computers, vol. 49, no. 1, pp. 81-87, Jan. 2000.
[21] X. Qin, H. Jiang, C. Xie, and Z. Han, “Reliability Driven Scheduling for Real-time Tasks with Precedence Constraints in Heterogeneous Distributed Systems,” Proc. Int'l Conf. Parallel and Distributed Computing and Systems (PDCS '00), pp. 617-623, Nov. 2000.
[22] N. Auluck and D.P. Agrawal, “Reliability Driven, Non-Preemptive Real-Time Scheduling of Periodic Tasks on Heterogeneous Systems,” Proc. IASTED Int'l Conf. Parallel and Distributed Computing and Systems (PDCS '02), pp. 803-809, Nov. 2002.
[23] N. Auluck and D.P. Agrawal, “A Scalable Task Duplication Based Algorithm for Improving the Schedulability of Real-Time Heterogeneous Multiprocessor Systems,” Proc. ICPP Second Int'l Workshop on Compile/Run Time Techniques for Parallel Computing (CRTPC '03), pp. 89-96, Oct. 2003.
[24] S. Srinivasan and N.K. Jha, “Safety and Reliability Driven Task Allocation in Distributed Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 3, pp. 238-251, Mar. 1999.
[25] E. Huh, L. Welch, B. Shirazi, and C. Cavanaugh, “Heterogeneous Resource Management for Dynamic Real-Time Systems,” Proc. Ninth Heterogeneous Computing Workshop (HCW '00), pp. 287-296, 2000.
[26] R.A. Omari, A.K. Somani, and G. Manimaran, “An Adaptive Scheme for Fault-Tolerant Scheduling of Soft Real-Time Tasks inMultiprocessor Systems,” J. Parallel and Distributed Computing, vol. 65, no. 5, pp. 595-608, May 2005.
[27] C.H. Papadimitrou and M. Yannakakis, “Towards an Architecture-Independent Analysis of Parallel Algorithms,” SIAM J. Computing, vol. 19, no. 2, pp. 322-328, Apr. 1990.
[28] C. Lu, X. Wang, and X. Koutsoukos, “Feedback Utilization Control in Distributed Real-Time Systems with End-to-End Tasks,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 6, pp. 550-561, June 2005.
[29] J.W.S. Liu and C.L. Liu, “Bounds on Scheduling Algorithms for Heterogeneous Computing Systems,” Information Processing 74, pp. 349-353, 1974.
[30] S. Ranaweera and D.P. Agrawal, “A Scalable Task Duplication Based Scheduling Algorithm for Heterogeneous Systems,” Proc. Int'l Conf. Parallel Processing (ICPP '00), pp. 383-390, Aug. 2000.
[31] S. Darbha and D.P. Agrawal, “Optimal Scheduling Algorithm for Distributed Memory Machines,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 1, pp. 87-95, Jan. 1998.
[32] R. Bajaj and D.P. Agrawal, “Improving Scheduling of Tasks in a Heterogeneous Environment,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 2, pp. 107-118, Feb. 2004.
[33] B.P. Dave, G. Lakshminarayana, and N. Jha, “COSYN: Hardware/Software Co-Synthesis of Embedded Systems,” Proc. 34th Ann. Conf. Design Automation (DAC '97), pp. 703-708, 1997.
[34] R.P. Dick and N.K. Jha, “MOGAC: A Multiobjective Genetic Algorithm for Hardware-Software Co-Synthesis of Hierarchical Heterogeneous Distributed Embedded Systems,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 17, no. 10, pp. 920-935, Oct. 1998.
[35] S. Baruah and J. Goossens, “The Static-Priority Scheduling of Periodic Task Systems upon Identical Multiprocessor Platforms,” Proc. IASTED Int'l Conf. Parallel and Distributed Computing and Systems (PDCS '03), pp. 427-432, Nov. 2003.
[36] S. Baruah and J. Anderson, “Energy Efficient Synthesis of Periodic Task Systems upon Identical Multiprocessor Systems,” Proc. 24th Int'l Conf. Distributed Computing Systems (ICDCS '04), pp. 428-435, Mar. 2004.
[37] X. Qin, “Improving Network Performance through Task Duplication for Parallel Application on Clusters,” Proc. 24th IEEE Int'l Performance Computing and Comm. Conf. (IPCCC '05), pp. 35-42, Apr. 2005.
[38] I. Ahmad and Y.K. Kwok, “On Exploiting Task Duplication in Parallel Program Scheduling,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 9, pp. 872-892, Sept. 1998.
[39] Y.C. Chung and S. Ranka, “Application and Performance Analysis of a Compile-Time Optimization Approach for List Scheduling Algorithms on Distributed Memory Multiprocessors,” Proc. ACM/IEEE Conf. Supercomputing, pp. 512-521, 1992.
[40] N. Guan, Z. Gu, Q. Deng, S. Gao, and G. Yu, “Exact Schedulability Analysis for Static-Priority Global Multiprocessor Scheduling Using Model Checking,” Proc. IFIP Workshop Software Technologies for Future Embedded and Ubiquitous Systems (SEUS), 2007.
[41] D. Rhodes and W. Wolf, “Allocation and Data Arrival Design of Hard Real-Time Systems,” Proc. Int'l Conf. Computer Design (ICCD'97), pp. 393-399, 1997.
[42] C.M. Krishna and K.G. Shin, Real-Time Systems. McGraw-Hill, 1997.
[43] The Standard Task Graph Set, http://www.kasahara.elec.waseda. ac.jpschedule , 2008.
[44] R. Dick, D. Rhodes, and W. Wolf, “TGFF: Task Graphs for Free,” Proc. Sixth Int'l Workshop Hardware/Software Codesign (CODES/CASHE '98), pp. 97-101, Mar. 1998.

Index Terms:
Favorite predecessor, heterogeneous network of workstations, periodic tasks, precedence constraints, real-time scheduling, subtask compaction, subtask duplication.
Citation:
Nitin Auluck, Dharma P. Agrawal, "Enhancing the Schedulability of Real-Time Heterogeneous Networks of Workstations (NOWs)," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 11, pp. 1586-1599, Nov. 2009, doi:10.1109/TPDS.2008.247
Usage of this product signifies your acceptance of the Terms of Use.