{"title":"A Lightweight Iterative Compilation Approach for Optimization Parameter Selection","authors":"Yonggang Che, Zhenghua Wang","doi":"10.1109/IMSCCS.2006.11","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.11","url":null,"abstract":"A key step in program performance optimization is to determine optimal values for certain parameters. Static approaches determine these values based on analytical models. However, complex computer architectures and complex code structures limit the strength of them. Execution-driven approaches like iterative compilation determine these parameter values by executing the program with different parameter values and select the one with the shortest runtime. These approaches can find excellent results for they accurately account for all machine and program components. But the expensive compilation cost has limited their application scope to embedded applications and a small group of math kernels. We propose a low cost iterative compilation approach Lega (limited execution and genetic algorithm) for scientific program optimization parameter selection. It consists of three components: (1)parameterizations to make use of the native compiler; (2) program reduction transformations to reduce the time spent on evaluating each parameter value; (3)genetic algorithm to accelerate the parameter search process. We apply Lega to three math kernels and three SPEC95 benchmarks on two platforms. Results show that Lega can find excellent parameters comparable to previous iterative methods in much shorter time. Its cost is 5.4% of the original iterative compilation for the three math kernels on average. And its cost is 47.22% of the original iterative compilation for the three SPEC95 benchmarks on average, although the latter uses training input set instead of reference input set for the search procedure","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125677132","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":"Improving Grid Scheduling of Pipelined Data Processing by Combining Heuristic Algorithms and Simulated Annealing","authors":"Qingjiang Wang, Lin Zhang","doi":"10.1109/IMSCCS.2006.79","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.79","url":null,"abstract":"To improve the performance of pipelined data processing on computational grids, the method combining simulated annealing with a set of heuristic algorithms is presented to optimize grid scheduling. Pipelined data processing is divided into multiple sub-applications, and every sub-application is supposed moldable. Thus, sub-applications should be assigned onto their appropriate grid nodes, while parallel degrees should be determined reasonably. On one grid node, sub-applications are supposed to spatially share processor resources, and a set of heuristic algorithms is presented to optimize parallel degrees for different performance parameters respectively, based on which simulated annealing is simplified for optimizing sub-application assignments. Experiments show that the throughput or latency of pipelined data processing can be efficiently improved by the optimization of grid scheduling","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124338546","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 Mapping Methodology for Space-Time Adaptive Processing in Heterogeneous Processors Environment","authors":"Yinbo Shao, Yongliang Wang, Qiang Li, Xuesu Xiao","doi":"10.1109/IMSCCS.2006.12","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.12","url":null,"abstract":"Space-time adaptive processing (STAP) is the key technology of new generation airborne digital signal processing systems. A major challenge in implementing STAP is to meet the real-time requirement while using fewer processors. To meet these requirements, a unified framework for STAP task mapping is developed. In this framework, a STAP task model is firstly brought forward, which exploits the fact that tasks in each stage are independent. Different types of processors are considered and a four-step task mapping methodology is developed. Experimental results show that our methodology can save processors while meeting real-time requirement","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116570827","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 New Particle Model For Prediction Coding of Lossless Data Compression","authors":"D. Shuai, Qing Shuai","doi":"10.1109/IMSCCS.2006.15","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.15","url":null,"abstract":"This paper presents a new generalized particle model (GPM) to generate the prediction coding for lossless data compression. Local rules for particle movement in GPM, parallel algorithm and its implementation structure to generate the desired predictive coding are discussed. The proposed GPM approach has advantages in terms of encoding speed, parallelism, scalability, simplicity, and easy hardware implementation over other sequential lossless compression methods","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"52 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116565195","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":"Real-time Visualization Based on Deformed X-ray Fluoroscopy","authors":"Wenqiang Zhang, Xuemei Huang, Liming Zhang","doi":"10.1109/IMSCCS.2006.110","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.110","url":null,"abstract":"This paper is to highlight a concept for computer aided navigation system that uses fluoroscopic image as a basis for real-time surgical tools navigation. Unfortunately, the inherent distortion of the fluoroscopic image deteriorates the quality of surgical navigation. Combing with global and local correction methods, a novel approach for distortion correction is proposed which allows good image quality in relatively acceptable time. A linear cone beam projection model is setup, and the associate transformation that models the actual X-ray projection is calculated","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128812958","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":"Feature Analysis and De-noising of MRS Data Based on Pattern Recognition and Wavelet Transform","authors":"Guangbo Dong, Jian Ma, G. Xie, Zeng-qi Sun","doi":"10.1109/IMSCCS.2006.64","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.64","url":null,"abstract":"De-noising the MRS data is a key processing in analysis of spectroscopy MRS data. This paper presents an effective method based on wavelet-transform and pattern recognition technologies. Upon the characteristics of MRS data, a new wavelet basis function was designed, and a de-noising method of free induction decay (FID) data using wavelet threshold to obtain better MRS spectrums was conduced; hence, the features of some cancers from MRS spectrums based on independent component analysis (ICA) and support vector machine (SVM) were extended. Comparing with the de-nosing effect using conventional wavelet basis functions, experiments were conducted to validate that the innovative feature extraction method employing ICA and a new wavelet filter set has higher and better performance. Experiments in this study were carried out on a small amount of real and low SNR dataset that obtained from the GE NMR device. The experimental results showed that the proposed de-nosing method improves its efficiency of feature extraction significantly","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128278643","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":"Membership Dependable Failure Detectors","authors":"Jingcheng Zhang, Jiaqiang Zhu, Jihong Zhu","doi":"10.1109/IMSCCS.2006.86","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.86","url":null,"abstract":"In this paper we extend the function of group membership to cover whether a process is correct or not with respect to specification. We introduce the concept of (m, n) reliable membership failure detectors and formally define three failure detector classes PMD diam PMD and WMD in terms of their ability to implement reliable group membership services. We show that the perfect failure detectors and eventually perfect failure detectors are sub classes of (0, 0) PMD and (0, 0) WMD respectively in systems subject to only crash failures. Combining muteness failure detectors with the modular approach introduced for Byzantine systems, we propose a failure detector called RMSFD. By studying its reliability property, we prove that RMSFD is a failure detector of (0, 0) WMD","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126405006","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 Development Framework for Collaborative Applications Based on the Access Grid","authors":"Yingjie Xia, Yao Zheng, X. Zhu, C. Kong","doi":"10.1109/IMSCCS.2006.4","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.4","url":null,"abstract":"Developing collaborative applications presents a challenge in solving the communication and synchronization problems. In this paper, we introduce a framework created to assist the developers. The framework takes the advantage of the access grid (AG) components, venue server, venue client and event channel, aiming to build a collaborative environment. In addition, the framework contains two user interface components, a wizard providing an interface to import new applications, and a main frame listing all the applications developed upon the framework. For a testing task, we implemented some collaborative applications using this framework. And the examples demonstrate that the framework enables the users to develop collaborative applications conveniently and efficiently","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125265460","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":"Fast Measurement of Human Face and Disposal of Measured Points","authors":"Jian Li, Minghe Li, Ying Zheng, Jianwen Wang","doi":"10.1109/IMSCCS.2006.63","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.63","url":null,"abstract":"A fast measurement method of human face and a data disposal algorithm to filter noise in the measured points of human face are proposed in this paper. The components and working principle of the measurement system are first analyzed, which uses double CCD (charge coupled device) and line laser as the measurement devices to improve the measuring speed and avoid the measuring blind zone. Then the fuzzy weighted average filtering algorithm is introduced to filter noise in the measured data. Different from the average and median filtering algorithms, the algorithm proposed uses fuzzy membership idea to optimize the weights of the neighboring points by iteration method and achieves a better filtering effect. The effectiveness of the measurement system and the filtering method are verified through the measurement of a human face and comparison between the disposal results of the proposed method and other methods","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121538225","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":"Reliable and Efficient Data Transfer Protocol Based on UDP in Cluster System","authors":"Jigang Wang, Guochang Gu, Shibo Xie, Lifeng Xu","doi":"10.1109/IMSCCS.2006.113","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.113","url":null,"abstract":"In cluster system, a fast communication mechanism is absolutely necessarily. This paper deeply studies existing problems and limitation of primary data transfer protocols at present, proposes a reliable and efficient data transfer protocol based on UDP, also provides an analytical model to predict REUDP's performance. REUDP make efforts to enhance the ability of cluster system communication under assured reliability. Theoretic analysis shows that REUDP can guarantee network reliability and high-speed bulk data transfer. Experiment results show that REUDP performs extremely efficiently over high speed dedicated networks and our model is able to provide good estimates of its performance","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121977247","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}