|
[1] ARM11 mpcore technical manual. In http://infocenter.arm.com/help/topic/com.arm.doc.ddi0360d [2] Advanced video coding for generic audiovisual services. In ITU-T Recommendation H.264, March 2005. [3] Nabil R. Adam and John C. Worthmann. Security-control methods for statistical databases: a comparative study. ACM Computing Surveys, 21(4):515-556,1989. [4] Bjorn Andersson, Sanjoy Baruah, and Jan Jonsson. Static-priority scheduling on multiprocessors. In Proceedings of the 22nd IEEE Real-Time Systems Symposium, pages 193-202, Washington, DC, USA, 2001. IEEE Computer Society. [5] Theodore P. Baker. An analysis of xed-priority schedulability on a multiprocessor. Real-Time System, 32(1-2):49-71, 2006. [6] JOrgen Bang-Jensen, Harold N. Gabow, and Tibor Jordan. Edge-connectivity augmentation with partition constraints. SIAM Journal on Discrete Mathematics, 12(2):160-207, 1999. [7] Sanjoy K. Baruah. Scheduling periodic tasks on uniform multiprocessors. Information Processing Letters, 80(2):97-104, 2001. [8] Sanjoy K. Baruah and Joel Goossens. Rate-monotonic scheduling on uniform multiprocessors. IEEE Transactions on Computers, 52(7):966{970, 2003. [9] Sanjoy K. Baruah and Mary Ellen Hickey. Competitive on-line scheduling of imprecise computations. IEEE Transactions on Computers, 47(9):1027-1032,1998. [10] STI Cell BE. In http://www.ibm.com/developerworks/power/cell/. [11] Jia-Ming Chen, Chiu-Ling Chen, Jian-Liang Luo, Po-Wen Cheng, Chia-Hao Yu, Shau-Yin Tseng, and Wei-Kuan Shih. Realization and optimization of H.264 decoder for dual-core SoC. Technical report, computer science, 2007. [12] Francis Y. Chin and G. Ozsoyoglu. Auditing and inference control in statistical databases. IEEE Transactions Software Engineering, 8(6):574-582, 1982. [13] Ka Wong Chong, Yijie Han, and Tak Wah Lam. Concurrent threads and optimal parallel minimum spanning trees algorithm. Journal of the ACM, 48(2):297-323, 2001. [14] Jen-Yao Chung, Wei-Kuan Shih, Jane W.S. Liu, and Donald W. Gillies. Scheduling imprecise computations to minimize total error. Microprocessing and Microprogramming, 27:767-774, 1989. [15] Richard Cole and Uzi Vishkin. Approximate parallel scheduling. Part II: Applications to logarithmic-time optimal graph algorithms. Information and Computation, 92(1):1-47, 1991. [16] Lawrence H. Cox. Suppression methodology and statistical disclosure control. Journal of the American Statistical Association, 75(370):377-385, 1980. [17] Leonardo Dagum and Ramesh Menon. Openmp: An industry-standard api for shared-memory programming. Computing in Science and Engineering, 5:46-55,1998. [18] Dorothy Elizabeth Robling Denning and Jan Schlorer. Inference controls for statistical databases. IEEE Computer, 16:69-82, 1983. [19] Jack J. Dongarra, Steve W. Otto, Marc Snir, and David Walker. A message passing standard for MPP and workstations. Communications of the ACM, 39(7):84-90, 1996. [20] Kapali P. Eswaran and R. Endre Tarjan. Augmentation problems. SIAM Journal on Computing, 5:653-665, 1976. [21] A. Frank. Connectivity augmentation problems in network design. In J.R. Birge and K.G. Murty, editors, Mathematical Programming: State of the Art 1994, pages 34-63. The University of Michigan, 1994. [22] Joe Goossens, Shelby Funk, and Sanjoy Baruah. Priority-driven scheduling of periodic task systems on multiprocessors. Real-Time System, 25(2-3):187-205, 2003. [23] Dan Gusfield. A graph theoretic approach to statistical data security. SIAM Journal on Computing, 17(3):552-571, 1988. [24] Frank Harary. Graph theory. Reading: Addison-Wesley Series in Mathematics, 1969. [25] Frederick S. Hillier and Gerald J. Lieberman. Introduction to Operations Research. McGraw-Hill Science/Engineering/Math, ninth edition, 2010. [26] Tsan-sheng Hsu. Graph augmentation and related problems: theory and practice. PhD thesis, University of Texas at Austin, TX, USA, 1993. [27] Tsan-sheng Hsu. On four-connecting a triconnected graph. Journal of Algorithms, 35(2):202-234, 2000. [28] Tsan-sheng Hsu. Simpler and faster biconnectivity augmentation. Journal of Algorithms, 45(1):55-71, 2002. [29] Tsan-sheng Hsu and Ming-Yang Kao. Optimal augmentation for bipartite componentwise biconnectivity in linear time. SIAM Journal on Discrete Mathematics, 19(2):345-362, 2005. [30] The Khronos Group Inc. Openmax development layer api specification version 1.0.1. 2006. [31] Texas Instruments. expressdsp algorithm interface standard. In http://focus.ti.com/docs/toolsw/folders/print/tmdxdaisxdm.html. [32] ITRI. In http://www.itri.org.tw/. [33] Jose L. Daz Jose M. Lopez and Daniel F. Garca. Minimum and maximum utilization bounds for multiprocessor rate monotonic scheduling. IEEE Transactions on Parallel and Distributed Systems, 15(7):642-653, 2004. [34] Ming-Yang Kao. Linear-time optimal augmentation for componentwise bipartite-completeness of graphs. Information Processing Letters, 54(1):59-63, 1995. [35] Ming-Yang Kao. Data security equals graph connectivity. SIAM Journal on Discrete Mathematics, 9(1):87-100, 1996. [36] Ming-Yang Kao. Total protection of analytic-invariant information in crosstabulated tables. SIAM Journal on Computing, 26(1):231-242, 1997. [37] James P. Kelly, Bruce L. Golden, and Arjang A. Assad. Cell suppression:Disclosure protection for sensitive tabular data. Networks, 22(4):397-417,1992. [38] khronos. In http://www.khronos.org/openmax/. [39] Jorg Liebeherr, Almut Burchard, Yingfeng Oh, and Sang H. Son. New strategies for assigning real-time tasks to multiprocessor systems. IEEE Transactions on Computers, 44(12):1429-1442, 1995. [40] Chang L Liu and James W Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1):46-61, 1973. [41] Jane W.S. Liu, Wei-Kuan Shih, Kwei-Jay Lin, R. Bettati, and Jen-Yao Chung. Imprecise computations. IEEE Special Issue on Real-Time Systems, 82(1):83-94, 1994. [42] Jose Maria Lopez, Manuel Barrena Garcia, Jose Luis Diaz, and Daniel Fernando Garcia. Utilization bounds for multiprocessor rate-monotonic scheduling. Real-Time System, 24(1):5-28, 2003. [43] Wan-Chen Lu, Kwei-Jay Lin, Hsin-Wen Wei, and Wei-Kuan Shih. Rate monotonic schedulability tests using period-dependent conditions. Real-Time System, 37(2):123-138, 2007. [44] Lars Lundberg. Analyzing Ffxed-priority global multiprocessor scheduling. In Proceedings of the 8th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02), page 145, Washington, DC, USA, 2002. IEEEComputer Society. [45] Cor Meenderinck, Arnaldo Azevedo, Mauricio Alvarez, Ben Juurlink, and Alex Ramirez. Parallel scalability of H.264. 2008. [46] H. Nagamochi. Recent development of graph connectivity augmentation algorithms. IEICE Transactions on Information and Systems, 83(3):372-383,2000. [47] Vincent Nelis, Joel Goossens, Raymond Devillers, Dragomir Milojevic, and Nicolas Navet. Power-aware real-time scheduling upon identical multiprocessor platforms. In SUTC '08: Proceedings of the 2008 IEEE International Confer- ence on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008), pages 209-216, Washington, DC, USA, 2008. IEEE Computer Society. [48] ST Nomadik. In http://www.st.com. [49] Philips NXP. In http://www.nxp.com. [50] Dong Ik Oh and Theodore P. Baker. Utilization bounds for n-processor rate monotonescheduling with static processor assignment. Real-Time System, 15(2):183{192, 1998. [51] TI OMAP. In http://www.omap.com. [52] Vijaya Ramachandran. Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity. In J.H. Reif, editor, Synthesis of Parallel Algorithms, pages 275-340. Morgan-Kaufmann, 1993. [53] A. Rosenthal and A. Goldner. Smallest augmentations to biconnect a graph. SIAM Journal on Computing, 6:55-66, 1977. [54] Lui Sha, Tarek Abdelzaher, Karl-Eriken, Anton Cervin, Theodore Baker, Alan Burns, Giorgio Buttazzo, Marco Caccamo, John Lehoczky, and Aloysius K.Mok. Real time scheduling theory: A historical perspective. Real-Time System, 28(2-3):101-155, 2004. [55] Wei-Kuan Shih, Che-Rung Lee, and Ching-Hui Tang. A fast algorithm for scheduling imprecise computations with timing constraints to minimize weighted error. In The proceedings of the 21th IEEE Real-Time Systems Symposium, pages 305{310, 2000. [56] Wei-Kuan Shih and Jane W. S. Liu. Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error. IEEE Transactions on Computers, 44:466-471, 1995. [57] Wei-Kuan Shih and Jane W. S. Liu. On-line algorithms for scheduling imprecise computations. SIAM Journal on Computing, 25(5):1105-1121, 1996. [58] Wei-Kuan Shih, Jane W. S. Liu, and Jen-Yao Chung. Fast algorithms for scheduling imprecise computations. the Proceedings of Real Time Systems Symposium, pages 12-19, 1989. [59] Qualcomm Snapdragon. In http://www.qualcom.com. [60] Robert E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1:146-160, 1972. [61] Robert E. Tarjan and Uzi Vishkin. An efficient parallel biconnectivity algorithm. SIAM Journal on Computing, 14(4):862-874, 1985. [62] Brian Davidson Nick Merryman Troy Brant, Jonathan Clark. Porting an MPEG-2 decoder to the cell architecture. Technical report, Georgia Institute of Technology. [63] J Dongarra V.S Sunderam, G.A Geist and R Manchek. The pvm concurrent computing system: Evolution, experiences, and trends. Parallel Computing, 20(4):531-545, 1994. [64] Toshimasa Watanabe and Akira Nakamura. A minimum 3-connectivity augmentation of a graph. Journal of Computer and System Science, 46(1):91-128, 1993.
|