{"title":"Multiprocessor System-on-Chip Profiling Architecture: Design and Implementation","authors":"Po-Hui Chen, C. King, Yuan-Ying Chang, S. Tseng","doi":"10.1109/ICPADS.2009.118","DOIUrl":"https://doi.org/10.1109/ICPADS.2009.118","url":null,"abstract":"With the growing needs for advanced functionalities in modern embedded systems, it is now necessary to integrate multiple processors in the system, preferably on a single chip, to support the required computing complexity. The problem is that such multiprocessor system-on-chip (MPSoC) architecture is very complex and its internal behavior is very difficult to track. An effective tool for profiling the behavior of the MPSoC system is in great need. Such a tool is very useful during system design for exploiting various options and identifying potential bottlenecks. In this paper, we introduce the MultiProcessor Profiling Architecture (MPPA) -- a general framework for profiling MPSoC embedded systems. The MPPA framework entails the use of FPGA emulation for the target system, the embedding of performance counters for recording system events, and the development of OS drivers for collecting the profiled data. To demonstrate its use, we show the implementation of an MPSoC emulation system based on Leon3 cores following the MPPA framework. We also show how the MPPA framework and the emulator help the designers to identify performance problems and improve their MPSoC embedded system design.","PeriodicalId":366698,"journal":{"name":"2009 15th International Conference on Parallel and Distributed Systems","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121209514","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Speculation with Little Wasting: Saving Cost in Software Speculation through Transparent Learning","authors":"Yunlian Jiang, Feng Mao, Xipeng Shen","doi":"10.1109/ICPADS.2009.130","DOIUrl":"https://doi.org/10.1109/ICPADS.2009.130","url":null,"abstract":"Software speculation has shown promise in parallelizing programs with coarse-grained dynamic parallelism. However, most speculation systems use offline profiling for the selection of speculative regions. The mismatch with the input-sensitivity of dynamic parallelism may result in large numbers of speculation failures in many applications. Although with certain protection, the failed speculations may not hurt the basic efficiency of the application, the wasted computing resource (e.g. CPU time and power consumption) may severely degrade system throughput and efficiency. The importance of this issue continuously increases with the advent of multicore and parallelization in portable devices and multiprogramming environments. In this work, we propose the use of transparent statistical learning to make speculation cross-input adaptive. Across production runs of an application, the technique recognizes the patterns of the profitability of the speculative regions in the application and the relation between the profitability and program inputs. On a new run, the profitability of the regions are predicted accordingly and the speculations are switched on and off adaptively. The technique differs from previous techniques in that it requires no explicit training, but is able to adapt to changes in program inputs. It is applicable to both loop-level and function-level parallelism by learning across iterations and executions, permitting arbitrary depth of speculations. Its implementation in a recent software speculation system, namely the Behavior-Oriented Parallelization system, shows substantial reduction of speculation cost with negligible decrease (sometimes, considerable increase) of parallel execution performance.","PeriodicalId":366698,"journal":{"name":"2009 15th International Conference on Parallel and Distributed Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122120171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Fault-Free Unicast Algorithm in Twisted Cubes with the Restricted Faulty Node Set","authors":"Jianxi Fan, Shukui Zhang, X. Jia, Guangquan Zhang","doi":"10.1109/ICPADS.2009.40","DOIUrl":"https://doi.org/10.1109/ICPADS.2009.40","url":null,"abstract":"The dimensions of twisted cubes in the original definition of twisted cubes are only limited to odd integers. In this paper, we first extends the dimensions of twisted cubes to all the positive integers. Then, we introduce the concept of the set of restricted faulty nodes into twisted cubes. We further prove that under the condition that each node of the $n$-dimensional twisted cube $TQ_n$ has at least one fault-free neighbor its restricted connectivity is $2n-2$, which is almost as twice as that of $TQ_n$ under the condition of arbitrary faulty nodes, the same as that of the $n$-dimensional hypercube. Moreover, we give an $O(Nmbox{log}N)$ fault-free unicast algorithm, where $N$ denotes the node number of $TQ_{n-1}$. Finally, we give the simulation result of the expected length of the fault-free path gotten by our algorithm.","PeriodicalId":366698,"journal":{"name":"2009 15th International Conference on Parallel and Distributed Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122131213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Tianyin Xu, Weiwei Wang, Baoliu Ye, Wenzhong Li, Sanglu Lu, Yang Gao
{"title":"Prediction-Based Prefetching to Support VCR-like Operations in Gossip-Based P2P VoD Systems","authors":"Tianyin Xu, Weiwei Wang, Baoliu Ye, Wenzhong Li, Sanglu Lu, Yang Gao","doi":"10.1109/ICPADS.2009.60","DOIUrl":"https://doi.org/10.1109/ICPADS.2009.60","url":null,"abstract":"Supporting free VCR-like operations in P2P VoD streaming systems is challenging. The uncertainty of frequent VCR operations makes it difficult to provide high quality realtime streaming services over distributed self-organized P2P overlay networks. Recently, prefetching has emerged as a promising approach to smooth the streaming quality. However, how to efficiently and effectively prefetch suitable segments is still an open issue. In this paper, we propose PREP, a PREdiction-based Prefetching scheme to support VCR-like operations over gossip-based P2P on-demand streaming systems. By employing the reinforcement learning technique, PREP transforms users’ streaming service procedure into a set of abstract states and presents an online prediction model to predict a user’s VCR behavior via analyzing the large volumes of user viewing logs collected on the tracker. We further present a distributed data scheduling algorithm to proactively prefetch segments according to the predicted VCR behavior. Moreover, PREP takes advantage of the inherent peer collaboration of gossip protocol to optimize the response latency. Through comprehensive simulations, we demonstrate the efficiency of PREP by gaining the accumulated hit ratio close to 75% while reducing the response latency close to 70% with only less than 15% extra stress on the server side.","PeriodicalId":366698,"journal":{"name":"2009 15th International Conference on Parallel and Distributed Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128347682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Optimized String Transformation Algorithm for Real-Time Group Editors","authors":"Bin Shao, Du Li, Ning Gu","doi":"10.1109/ICPADS.2009.72","DOIUrl":"https://doi.org/10.1109/ICPADS.2009.72","url":null,"abstract":"Operational transformation (OT) is an optimistic consistency control method for supporting collaboration over high-latency networks. The technique lies in the heart of many recent products such as Google Wave. It replicates the shared data and allows the users to concurrently modify any part of a shared document in a nonblocking manner. Most of the published results only support two characterwise primitives and take $O(|H|^2)$ or even longer time to integrate one remote characterwise operation, where $H$ is the operation history. However, as the history grows long and operations are integrated in batches, the high complexity can make an algorithm easily exceed the 100 ms responsiveness threshold that is critical for interactive applications. This paper proposes a new OT algorithm that supports string primitives and reduces the time complexity to $O(|H|)$. The result can be used in a range of parallel and distributed applications that can be abstracted as realtime group editors.","PeriodicalId":366698,"journal":{"name":"2009 15th International Conference on Parallel and Distributed Systems","volume":"415 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126697351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Case of Parallel EEG Data Processing upon a Beowulf Cluster","authors":"Yufeng Yao, Jinyi Chang, Kaijian Xia","doi":"10.1109/ICPADS.2009.65","DOIUrl":"https://doi.org/10.1109/ICPADS.2009.65","url":null,"abstract":"Electroencephalogram (EEG) data processing applications have become routine tasks in both bioscience and neuroscience research, which are usually highly compute and data intensive. In this paper, we present a parallel method to analyze the huge EEG data with a Beowulf cluster. Through an example of the synchronization measurement of multiple neuronal populations, the procedure of exploiting the parallelism of EEG data processing applications to achieve speed-up has been detailed. The experimental results indicate that the execution efficiency of EEG data processing can be improved dramatically using parallel and distributed computing techniques even with inexpensive computing platform.","PeriodicalId":366698,"journal":{"name":"2009 15th International Conference on Parallel and Distributed Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126796888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance under Failure of Multi-tier Web Services","authors":"Bing Xie, Yong Chen, Xian-He Sun, Hui Jin","doi":"10.1109/ICPADS.2009.84","DOIUrl":"https://doi.org/10.1109/ICPADS.2009.84","url":null,"abstract":"Performance issues of multi-tier Web Services have been studied extensively in recent years. Performance modeling and prediction under failure of multi-tier architectures, however, is not well addressed yet. We propose a novel model named Performance under Failure of Multi-tier Architecture, or PerFAMA in short, to address this issue. We first show that the multi-tier architecture with failure considerations is a product-form network, and then analyze and model the failure impact. By applying the PerFAMA model, we are able to predict the end-to-end response time of multi-tier Web Services under failures. We have simulated two representative Web Services architectures and various failure scenarios to verify the proposed PerFAMA model. The experimental results show that the proposed model works well and the prediction accuracy is up to 98%.","PeriodicalId":366698,"journal":{"name":"2009 15th International Conference on Parallel and Distributed Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127005331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards a Scalable Real-Time Cyberinfrastructure for Online Computer Games","authors":"S. Gorlatch, Frank Glinka, A. Ploss","doi":"10.1109/ICPADS.2009.94","DOIUrl":"https://doi.org/10.1109/ICPADS.2009.94","url":null,"abstract":"We propose a novel cyberinfrastructure for an emerging class of Internet-based Real-Time Online Interactive Applications (ROIA). The most challenging representative of this application class are massively multi-player online games. We present the results of the European project Edutain@Grid on the development of efficient cyberinfrastructure and scalable applications. We report experimental results demonstrating the performance and scalability of our approach.","PeriodicalId":366698,"journal":{"name":"2009 15th International Conference on Parallel and Distributed Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123987796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Quality of Service in Peer-to-Peer IPTV Networks","authors":"X. Lou, K. Hwang, Gaogang Xie","doi":"10.1109/ICPADS.2009.123","DOIUrl":"https://doi.org/10.1109/ICPADS.2009.123","url":null,"abstract":"In Peer-to-peer (P2P) IPTV networks, jitter rate is one of the most important metrics for Quality of Service. In this paper, we develop a new approach to estimate jitter rate during playback. Unlike traditional approaches that focus on the download speed, our method relies on the distribution of peer download latencies. We demonstrated how to apply the proposed methodologies in a real-life environment. We report simulation results over a P2P IPTV network with 5 seeds and 2,000 clients. Experimental results not only validated the theoretical projections, but also show that our model captures impacts of many design factors. It is thus suggested to use the proposed method as a guiding tool to design P2P IPTV networks with low jitter rate.","PeriodicalId":366698,"journal":{"name":"2009 15th International Conference on Parallel and Distributed Systems","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121282312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Hu, C. Xue, Wei-Che Tseng, Meikang Qiu, Yingchao Zhao, E. Sha
{"title":"Minimizing Memory Access Schedule for Memories","authors":"J. Hu, C. Xue, Wei-Che Tseng, Meikang Qiu, Yingchao Zhao, E. Sha","doi":"10.1109/ICPADS.2009.86","DOIUrl":"https://doi.org/10.1109/ICPADS.2009.86","url":null,"abstract":"According to the characteristics of the \"3-D\" structure of contemporary DRAM chips, the Row First Column Ordered (RFCO) algorithm is proposed in this paper to minimize memory access schedule length. In memory systems with a single memory controller, assuming that the memory access trace is known before scheduling, the RFCO algorithm can generate schedules which are 7.89% shorter than burst scheduling on average. If memory accesses are coming to the single memory controller in real time, the RFCO algorithm can generate schedules which are 8.03% shorter than burst scheduling on average.","PeriodicalId":366698,"journal":{"name":"2009 15th International Conference on Parallel and Distributed Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121437252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}