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

2009 WRI World Congress on computer Science and Information Engineering, CSIE 2009

作者： Michael, Panayiotis Adamos Parker Jr., D. Stott Computer Science Dept. - Scientific Computing Lab. UCLA-Anderson School of Management University of California Los Angeles Los Angeles CA United States

ISBN: (纸本)9780769535074

Four novel models define the fundamental temporal semantics upon which the Streamonas DSMS has been architected, as also the fundamental temporal semantics for application development on the system. Extensive experimental results demonstrate the power of the theoretical models as also the stability and scalability of the system when this is tested with a load from 2, 4, 6, 8 and 10 expressways when running the Linear Road Benchmark. The extensive experimental results demonstrate the effectiveness of the theoretical Semantic-Space Time models as the system has reached the maximum level of difficulty of the benchmark (10 expressways) with an average query latency of 0.000026 seconds, 192,307 times faster than the 5 seconds hard real-time constraint the benchmark sets. © 2008 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Machine learning based online performance prediction for runtime parallelization and task scheduling

Machine learning based online performance prediction for run...

引用

International Symposium on Performance Analysis of Systems and Software, ISPASS 2009

作者： Li, Jiangtian Ma, Xiaosong Singh, Karan Schulz, Martin De Supinski, Bronis McKee, Sally A. Dept. of Computer Science North Carolina State University Raleigh NC 27606 United States Computer Science and Mathematics Division Oak Ridge National Laboratory Oak Ridge TN 37831 United States Computer Systems Laboratory Cornell University Ithaca NY 14850 United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94550 United States Department of Computer Science and Engineering Chalmers University of Technology Göteborg Sweden

ISBN: (纸本)9781424441846

With the emerging many-core paradigm, parallel programming must extend beyond its traditional realm of scientific applications. Converting existing sequential applications as well as developing next-generation software requires assistance from hardware, compilers and runtime systems to exploit parallelism transparently within applications. These systems must decompose applications into tasks that can be executed in parallel and then schedule those tasks to minimize load imbalance. However, many systems lack a priori knowledge about the execution time of all tasks to perform effective load balancing with low scheduling overhead. In this paper, we approach this fundamental problem using machine learning techniques first to generate performance models for all tasks and then applying those models to perform automatic performance prediction across program executions. We also extend an existing scheduling algorithm to use generated task cost estimates for online task partitioning and scheduling. We implement the above techniques in the pR framework, which transparently parallelizes scripts in the popular R language, and evaluate their performance and overhead with both a realworld application and a large number of synthetic representative test scripts. Our experimental results show that our proposed approach significantly improves task partitioning and scheduling, with maximum improvements of 21.8%, 40.3% and 22.1% and average improvements of 15.9%, 16.9% and 4.2% for LMM (a real R application) and synthetic test cases with independent and dependent tasks, respectively. © 2009 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Haralick's texture features computed by GPUs for biological applications

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer Science 2009年第1期36卷

作者： Gipp, Markus Marcus, Guillermo Harder, Nathalie Suratanee, Apichat Rohr, Karl König, Rainer Männer, Reinhard Institute of Computer Science V Scientific Computing Group University of Heidelberg 68161 Mannheim Germany IPMB BIOQUANT and DKFZ Heidelberg Dept. Bioinformatics and Functional Genomics University of Heidelberg Im Neuenheimer Feld 267 69120 Heidelberg Germany

This paper presents an approach to speedup the computation of co-occurrence matrices and Haralick texture features, as used for analyzing microscopy images of cells, by general-purpose graphics processing units (GPUs). The sequence of computation steps for the features is analyzed based on a graph and an optimized version of the software is derived. Afterwards, a massive parallel software version for GPUs is designed and implemented. On a single node of a cluster, a speedup of a factor of 360 was obtained compared to the original software version, and a speedup of a factor of 32 was achieved compared to the optimized software version.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Timbral, perceptual, and statistical attributes for synthesized sound

Timbral, perceptual, and statistical attributes for synthesi...

引用

International computer Music Conference, ICMC 2006

作者： McDermott, James Griffith, Niall J.L. O'Neill, Michael Dept. of Computer Science and Information Systems University of Limerick Ireland Natural Computing Research and Applications Group University College Dublin Ireland

A set of 40 timbral, perceptual, and statistical sound attributes is described and studied, with reference to machine learning applications and statistical experiments using a software synthesizer. The attributes include trajectory, vibrato, and statistical subsets, and subsets defined in the time, Fouriertransform, and partial domains. High correlations between some attributes are confirmed: This has application to future choice of attributes for machine learning applications. The synthesizer's achievable attribute ranges give an indication of its relative flexibility and strengths, and the method described has application to synthesizer design.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

SSP algorithm for available bandwidth estimation

SSP algorithm for available bandwidth estimation

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：