检索结果-内蒙古大学图书馆

2006 International Conference on Communication Technology, ICCT '06

作者： Bian, Jing Wang, Ze-Qiang Zhang, Guang-Zhao Dept. of Scientific Computing and Computer Application Zhongshan University Guangzhou Guangdong 510275 China Dept. of Electronics and Communication Engineering Zhongshan University Guangzhou Guangdong 510275 China

ISBN: (纸本)1424408016

Available bandwidth is an important concept in network. Estimation for an end-to-end available bandwidth can help us to design overlay networks and end-system multicast, manage QoS and verify service level agreements. Although several estimation tools and techniques are proposed recently, more research is needed to improve them. In this paper, an end-to-end available bandwidth estimation algorithm SSP (SRdeg and SRdet parameters) is proposed based on the measurement of the one-way delay trend detection parameters SRdeg and SRdet. By measuring these two complementary parameters, SSP algorithm can And the turning point where the probe rate starting to incur congestion, and the end system can adjust the sending rate to probe the actual path's available bandwidth accurately, quickly and non-intrusively. The ns2 simulation experiment results show that SSP measurement is more accurate with less probing packets and less convergence time than the typical bandwidth estimation tool Pathload.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

On optimization and parallelization of fuzzy connected segmentation for medical imaging

On optimization and parallelization of fuzzy connected segme...

引用

20th International Conference on Advanced Information Networking and applications

作者： Gammage, Christopher Chaudhary, Vipin Computer Science Dept. Wayne State University Detroit MI Institute for Scientific Computing Wayne State University Detroit MI

ISBN: (纸本)0769524664

Fuzzy Connectedness is an important image segmentation routine for image processing of medical images. It is often used in preparation for surgery and sometimes during surgery. It is important to have an algorithm which can execute very fast, especially in the intra-operative environment. We have taken code from a popular image processing toolkit called ITK and ported it to a C environment. We optimized the implementation to give maximal performance (giving speedup of 23 times). We attempted three different levels of parallelization. We found that MPI was not an efficient method of parallelization as the algorithm is data dependant and large amounts of communication must be done. This communication overshadows the speed increase from doing computation on multiple processors, or nodes in a cluster. However, some limited speedup over the optimizations was obtained using OpenMP on an SMP system leading to a speedup of fifty using four processors over the original ITK implementation. © 2006 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

MSSG: A framework for massive-scale semantic graphs

MSSG: A framework for massive-scale semantic graphs

引用

2006 IEEE International Conference on Cluster computing, Cluster 2006

作者： Hartley, Timothy D. R. Catalyurek, Umit Özgüner, Füsun Yoo, Andy Kohn, Scott Henderson, Keith Dept. of Electrical and Computer Engineering Ohio State University Dept. of Biomedical Informatics Ohio State University Center for Applied Scientific Computing Lawrence Livermore National Laboratory

ISBN: (纸本)1424403286

This paper presents a middleware framework for storing, accessing and analyzing massive-scale semantic graphs. The framework, MSSG, targets scale-free semantic graphs with O(1012) (trillion) vertices and edges. Here, we present the overall architectural design of the framework, as well as a prototype implementation for cluster architectures. The sheer size of these massive-scale semantic graphs prohibits storing the entire graph in memory even on medium- to large-scale parallel architectures. We therefore propose a new graph database, grDB, for the efficient storage and retrieval of large scale-free semantic graphs on secondary storage. This new database supports the efficient and scalable execution of parallel out-of-core graph algorithms which are essential for analyzing semantic graphs of massive size. We have also developed a parallel out-of-core breadth-first search algorithm for performance study. To the best of our knowledge, it is the first of such algorithms reported in the literature. Experimental evaluations on large real-world semantic graphs show that the MSSG framework scales well, and grDB outperforms widely used open-source out-of-core databases, such as BerkeleyDB and MySQL, in the storage and retrieval of scale-free graphs. © 2006 IEEE.

关键词： Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Annotating user-defined abstractions for optimization 20

Annotating user-defined abstractions for optimization

引用

20th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2006

作者： Quinlan, Dan Schordan, Markus Vuduc, Richard Yi, Qing Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94550 United States Institute of Computer Languages Vienna University of Technology Vienna Austria Dept. of Computer Science University of Texas at San Antonio San Antonio TX 78249 United States

ISBN: (纸本)1424400546

Although conventional compilers implement a wide range of optimization techniques, they frequently miss opportunities to optimize the use of abstractions, largely because they are not designed to recognize and use the relevant semantic information about such abstractions. In this position paper, we propose a set of annotations to help communicate high-level semantic information about abstractions to the compiler, thereby enabling the large body of traditional compiler optimizations to be applied to the use of those abstractions. Our annotations explicitly describe properties of abstractions that are needed to guarantee the applicability and profitability of a broad variety of such optimizations, including memoization, reordering, data layout transformations, and Mining and specialization. © 2006 IEEE.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Topology-based simplification for feature extraction from 3D scalar fields

Topology-based simplification for feature extraction from 3D...

引用

VIS 05: IEEE Visualization 2005, Proceedings

作者： Gyulassy, Attila Natarajan, Vijay Pascucci, Valerio Bremer, Peer-Timo Hamann, Bernd Institute for Data Analysis and Visualization Dept. of Computer Science University of California Davis Center for Applied Scientific Computing Lawrence Livermore National Laboratory Dept. of Computer Science University of Illinois Urbana Champaign

ISBN: (纸本)0780394623

In this paper, we present a topological approach for simplifying continuous functions defined on volumetric domains. We introduce two atomic operations that remove pairs of critical points of the function and design a combinatorial algorithm that simplifies the Morse-Smale complex by repeated application of these operations. The Morse-Smale complex is a topological data structure that provides a compact representation of gradient flow between critical points of a function. Critical points paired by the Morse-Smale complex identify topological features and their importance. The simplification procedure leaves important critical points untouched, and is therefore useful for extracting desirable features. We also present a visualization of the simplified topology. © 2005 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Improving scientific software component quality through assertions

Improving scientific software component quality through asse...

引用

2nd International Workshop on Software Engineering for High Performance computing System applications, SE-HPCS '05, Co-located with the International Conference on Software Engineering, ICSE 2005

作者： Dahlgren, Tamara L. Devanbu, Premkumar T. Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States Centre for Software Systems Research Dept. of Computer Science University of California Davis CA United States

ISBN: (纸本)1595931171

We are proposing research on self-adaptive interface assertion enforcement for the purposes of improving scientific software component quality. Demonstrating software correctness through assertions is a well-known technique for quality improvement. However, the performance penalty is often considered too high for deployment. In order to determine if partial enforcement based on adaptive sampling is a viable solution in performance critical environments, we are pursuing research on mechanisms combining static and dynamic analyses to efficiently maximize assertion checking within performance constraints. This paper gives an overview of our initial experiments, current work, and plans. Copyright 2005 ACM.

关键词： Babel constrained enforcement interface assertions SIDL

来源：评论

学校读者我要写书评

暂无评论

Implementation and usability evaluation of AAC system for handicapped persons 1

引用

3rd International Conference on Human.Society@Internet - HSI 2005

作者： Park, Myoung-Soo Kim, Jonk-Ki Hur, Tai-Sung Kim, Nag-Hwan Lee, Eun-Sil Woo, Yo-Seop Min, Hong-Ki Dept. of Inf. and Telecomm. Eng. Univ. of Incheon Korea Republic of Dept. of Information Security Konyang University Nonsan Chung-Nam Korea Republic of Dept. of Computing and Information Systems Inha Technical College Incheon Korea Republic of Dept. of Computer Application Control Kyonggi Institute of Technology Korea Republic of

ISBN: (数字)9783540318088

ISBN: (纸本)9783540278306

This study generally is purposed to implementation and usability evaluation of augmentative and alternative communication system (hereinafter referred to as an "AAC system"). Also the device is aimed as an AAC system using symbols for HCI, allowing a handicapped person to make a general communication with others in a free and convenient manner. This study specifically presents a method of predicting predictions, which contributes to reducing the size of the AAC system. This method includes selecting vocabulary and classifying it by domains so as to meet the characteristics of the AAC communication, using a noun thesaurus for semantic analysis, and building a sub-category dictionary. Accordingly, this study has verified the system by applying it to linguistically handicapped persons with different kinds of handicaps two times. © Springer-Verlag Berlin Heidelberg 2005.

关键词： computer systems

来源：评论

学校读者我要写书评

暂无评论

Linear Algebra and Its applications: Preface

引用

Linear Algebra and Its applications 2005年第1-3期411卷 1-2页

作者： Barrett, Wayne Hedayat, Samad Krattenthaler, Christian Loewy, Raphael Dept. of Math. and Computer Science University of Paderborn D-33095 Paderborn Germany Dept. of Mathematics and Statistics University of Regina Regina Sask. S4S 0A2 Canada Department of Mathematics University of Connecticut Storrs CT 06269-3009 United States Dept. of Math. and Computer Science Numer. Math./Scientific Computing Free University Berlin D-14195 Berlin Arnimallee 2-6 Germany

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptation point analysis for computation migration/checkpointing 05

Adaptation point analysis for computation migration/checkpoi...

引用

20th Annual ACM Symposium on Applied computing

作者： Ji, Yanqing Jiang, Mai Chaudhary, Vipin Elec. and Comp. Eng. Dept. Wayne State University MI 48201 United States Dept. of Computer Science Arkansas State University AR 72467 United States Institute for Scientific Computing Wayne State University MI 48201 United States

ISBN: (纸本)9781581139648

Finding the appropriate location of adaptation points for computation migration/checkpointing is critical since the distance between two consecutive adaptation points determines the migration/checkpointing scheme's sensitivity and overheads. This paper proposes a heuristic adaptation point placement algorithm to improve the computation migration/checkpointing schemes' performance in terms of sensitivity and flexibility. This heuristic algorithm enables automatic and transparent insertion of checkpoints in user's source code. Copyright 2005 ACM.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

Automatically tuned FFTs for BlueGene/L's double FPU

Automatically tuned FFTs for BlueGene/L's double FPU

引用

6th International Conference - High Performance computing for Computational Science - VECPAR 2004

作者： Franchetti, Franz Kral, Stefan Lorenz, Juergen Püschel, Markus Ueberhuber, Christoph W. Institute for Analysis and Scientific Computing Vienna University of Technology Wiedner Hauptstrasse 8-10 A-1040 Wien Austria Dept. of Electrical and Computer Engineering Carnegie Mellon University 5000 Forbes Avenue Pittsburgh PA 15213 United States

IBM is currently developing the new line of BlueGene/L supercomputers. The top-of-the-line installation is planned to be a 65, 536 processors system featuring a peak performance of 360 Tflop/s. This system is supposed to lead the TOP 500 list when being installed in 2005 at the Lawrence Livermore National Laboratory. This paper presents one of the first numerical kernels run on a prototype BlueGene/L machine. We tuned our formal vectorization approach as well as the Vienna MAP vectorizer to support BlueGene/L's custom two-way short vector SIMD "double" floating-point unit and connected the resulting methods to the automatic performance tuning systems SPIRAL and FFTW. Our approach produces automatically tuned high-performance FFT kernels for Blue-Gene/L that are up to 45 % faster than the best scalar SPIRAL generated code and up to 75 % faster than FFTW when run on a single BlueGene/L processor. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：