
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
B. D. Bui, R. Pellizzoni, M. Caccamo, "RealTime Scheduling of Concurrent Transactions in Multidomain Ring Buses," IEEE Transactions on Computers, vol. 61, no. 9, pp. 13111324, Sept., 2012.  
BibTex  x  
@article{ 10.1109/TC.2011.151, author = {B. D. Bui and R. Pellizzoni and M. Caccamo}, title = {RealTime Scheduling of Concurrent Transactions in Multidomain Ring Buses}, journal ={IEEE Transactions on Computers}, volume = {61}, number = {9}, issn = {00189340}, year = {2012}, pages = {13111324}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2011.151}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  RealTime Scheduling of Concurrent Transactions in Multidomain Ring Buses IS  9 SN  00189340 SP1311 EP1324 EPD  13111324 A1  B. D. Bui, A1  R. Pellizzoni, A1  M. Caccamo, PY  2012 KW  system buses KW  multiprocessing systems KW  network topology KW  networkonchip KW  processor scheduling KW  SoC KW  concurrent periodic realtime transaction scheduling KW  multidomain ring buses KW  MDRB KW  multiple nonoverlapping transactions KW  bus topology KW  topographical acyclic transaction sets KW  executiontime overhead KW  realtime networkonchip scheduling KW  NoC KW  manycore systemonchip KW  Real time systems KW  Schedules KW  Systemonachip KW  Scheduling KW  Optimal scheduling KW  Scheduling algorithm KW  realtime networkonchip scheduling. KW  Realtime communications KW  realtime scheduling VL  61 JA  IEEE Transactions on Computers ER   
[1] A. Agarwal, C. Iskander, and R. Shankar, “Survey of NetworkonChip (NoC) Architectures & Contributions,” J. Eng., Computing and Architecture, vol. 3, no. 1, 2009.
[2] T.W. Ainsworth and T.M. Pinkston, “Characterizing the Cell EIB OnChip Network,” IEEE Micro, vol. 27, no. 5, pp. 614, Sept./Oct. 2007.
[3] S. Balakrishnan and F. Özgüner, “A PriorityDriven Flow Control Mechanism for RealTime Traffic in Multiprocessor Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 7, pp. 664678, July 1998.
[4] S.K. Baruah, N.K. Cohen, C.G. Plaxton, and D.A. Varvel, “Proportionate Progress: A Notion of Fairness in Resource Allocation,” STOC '93: Proc. 25th Ann. ACM Symp. Theory of Computing, pp. 345354, 1993.
[5] E. Bini and G.C. Buttazzo, “Measuring the Performance of Schedulability Tests,” RealTime Systems, vol. 30, nos. 1/2, pp. 129154, 2005.
[6] T. Bjerregaard and S. Mahadevan, “A Survey of Research and Practices of NetworkonChip,” ACM Computing Surveys, vol. 38, no. 1, p. 1, 2006.
[7] T. Chen, R. Raghavan, J. Dale, and E. Iwata, “Cell Broadband Engine Architecture and Its First Implementation: A Performance View,” IBM J. Research and Development, vol. 51, no. 5, pp. 559572, 2005.
[8] J. Howard et al., “A 48Core IA32 MessagePassing Processor with DVFS in 45nm CMOS,” Proc. IEEE Int'l SolidState Circuits Conf., 2010.
[9] K. Goossens, J. Dielissen, and A. Radulescu, “Aethereal Network on Chip: Concepts, Architectures, and Implementations,” IEEE Design and Test of Computers,, vol. 22, no. 5, pp. 414421, Sept./Oct. 2005.
[10] S. Gopalakrishnan, L. Sha, and M. Caccamo, “Hard RealTime Communication in BusBased Networks,” RTSS '04: Proc. 25th IEEE Int'l RealTime Systems Symp., pp. 405414, 2004.
[11] P. Holman and J.H. Anderson, “Adapting Pfair Scheduling for Symmetric Multiprocessors,” J. Embedded Computing, vol. 1, no. 4, pp. 543564, 2005.
[12] J. Kleinberg and E. Tardos, Algorithm Design. AddisonWesley Longman Publishing Co., Inc., 2005.
[13] J.P. Lehoczky and L. Sha, “Performance of RealTime Bus Scheduling Algorithms,” SIGMETRICS Performance Evaluation Rev., vol. 14, no. 1, pp. 4453, 1986.
[14] J. Li and M.W. Mutka, “RealTime Virtual Channel Flow Control,” J. Parallel and Distributed Computing, vol. 32, no. 1, pp. 4965, 1996.
[15] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a HardRealTime Environment,” J. ACM, vol. 20, no. 1, pp. 4661, 1973.
[16] C.D. Locke, D.R. Vogel, L. Lucas, and J.B. Goodenough, “Generic Avionics Software Specification,” Technical Report CMU/SEI90TR8, Software Eng. Inst., Carnegie Mellon Univ., 1990.
[17] Z. Lu, A. Jantsch, and I. Sander, “Feasibility Analysis of Messages for OnChip Networks Using Wormhole Routing,” ASPDAC '05: Proc. Asia and South Pacific Design Automation Conf., pp. 960964, 2005.
[18] M.D. Natale and A. Meschi, “Scheduling Messages with Earliest Deadline Techniques,” RealTime Systems, vol. 20, no. 3, pp. 255285, 2001.
[19] L.M. Ni and P.K. Mckinley, “A Survey of Wormhole Routing Techniques in Direct Networks,” Computer, vol. 26, no. 2, pp. 6276, Feb. 1993.
[20] IBM Research “Cell BE Programming Tutorial,” IBM, 2007.
[21] Z. Shi and A. Burns, “Priority Assignment for RealTime Wormhole Communication in OnChip Networks,” RTSS '08: Proc. RealTime Systems Symp., pp. 421430, 2008.
[22] Z. Shi and A. Burns, “RealTime Communication Analysis for OnChip Networks with Wormhole Switching,” NOCS '08: Proc. Second ACM/IEEE Int'l Symp. NetworksonChip, pp. 161170, 2008.
[23] K. Tindell, A. Burns, and A. Wellings, “Analysis of Hard RealTime Communications,” RealTime Systems, vol. 9, pp. 147171, 1995.
[24] D. Zhu, D. Mosse, and R. Melhem, “MultipleResource Periodic Scheduling Problem: How Much Fairness Is Necessary,” Proc. 24th IEEE Int'l RealTime Systems Symp., 2003.