The Greatest lover: a post-colonial rewriting of My Fair Lady

INTRODUCTION The popular Hong Kong comedy, The Greatest Lover, re-incarnates one of the most popular western musicals, My Fair Lady. OBJECTIVES 1. To find out in what major ways My Fair Lady was rewritten as the Hong Kong Cantonese movie, Gungzi Docing (The Greatest Lover). 2. To find out the socio-political, socio-linguistic, and gender ideology behind the rewriting. METHODOLOGY 1. To note the similarity of the themes for both works – a creator falling in love with his/her creation, and class prejudice and cross-class romance. 2. To note how the times of The Greatest Lover differ from that of My Fair Lady. 3. To note how the main characters in The Greatest Lover differ from My Fair Lady in terms of profession, gender, etc. 4. To note how the plot of The Greatest Lover differs from that of My Fair Lady. 5. To note how focus on language in The Greatest Lover compares with that in My Fair Lady. 6. To discuss the ideological implications of the differences noted above, e.g. women in Hong Kong today have much higher status than women in Victorian England; the conflict between local Hong Kong people and both legal and illegal immigrants from Mainland China is even more serious than that between the British upper middle class and the lower class during the Victorian period. 7. Andre Lefevere (1992) argues that translation and adaptation are rewriting informed and influenced by the rewriter’s ideology, among other things. 8. Both Aline Remael (1995) and Patrick Cattrysse (1992) think that film adaptation is a kind of translation. 9. Sirkkus Aaltonen (2000) argues that drama translation mirrors the ideologies of the target society. CONCLUSION 1. The Greatest Lover projects local cultural significance onto My Fair Lady by helping us to appreciate an important Western work of art through the Hong Kong Cantonese perspective. 2. Broader issues in translation and intercultural studies are also considered.

Response time analysis of COTS-Based multicores considering the contention on the shared memory bus

The current industry trend is towards using Commercially available Off-The-Shelf (COTS) based multicores for developing real time embedded systems, as opposed to the usage of custom-made hardware. In typical implementation of such COTS-based multicores, multiple cores access the main memory via a shared bus. This often leads to contention on this shared channel, which results in an increase of the response time of the tasks. Analyzing this increased response time, considering the contention on the shared bus, is challenging on COTS-based systems mainly because bus arbitration protocols are often undocumented and the exact instants at which the shared bus is accessed by tasks are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. This paper makes three contributions towards analyzing tasks scheduled on COTS-based multicores. Firstly, we describe a method to model the memory access patterns of a task. Secondly, we apply this model to analyze the worst case response time for a set of tasks. Although the required parameters to obtain the request profile can be obtained by static analysis, we provide an alternative method to experimentally obtain them by using performance monitoring counters (PMCs). We also compare our work against an existing approach and show that our approach outperforms it by providing tighter upper-bound on the number of bus requests generated by a task.

Finding an upper bound on the increase in execution time due to contention on the memory bus in COTS-based multicore systems

Contention on the memory bus in COTS based multicore systems is becoming a major determining factor of the execution time of a task. Analyzing this extra execution time is non-trivial because (i) bus arbitration protocols in such systems are often undocumented and (ii) the times when the memory bus is requested to be used are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. We present a method for finding an upper bound on the extra execution time of a task due to contention on the memory bus in COTS based multicore systems. This method makes no assumptions on the bus arbitration protocol (other than assuming that it is work-conserving).