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

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Tae Woong Choi P. Oscar Boykin Advanced Computing Information Systems Laboratory University of Florida USA

ISBN: (纸本)9781424465330

We present Deetoo, an algorithm to perform completely general queries, for instance high-dimensional proximity queries or regular expression matching, on a P2P network. Deetoo is an efficient unstructured query system on top of existing structured P2P ring topologies. Deetoo provides a reusable search tool to work alongside a DHT, thus, it provides new capabilities while reusing existing P2P models and software. Since our algorithm is for unstructured search, there is no structural relationship between the queries and the network topology and hence no need to provide a mapping of queries onto a fixed DHT structure. Deetoo is optimal in terms of the trade-off in querying and caching cost. For networks of size N, O(¿N) cost for both caching and querying is required to achieve a constant (in N) search success probability. Queries execute a time of O(log 2 N).

关键词： Peer to peer computing Data structures Network topology Broadcasting Cost function Computer networks High performance computing information systems Software reusability Software tools

来源：评论

学校读者我要写书评

暂无评论

Multicast grooming algorithm in waveband switching optical networks

引用

Journal of Lightwave Technology 2010年第19期28卷 2856-2864页

作者： Guo, Lei Wang, Xingwei Cao, Jiannong Hou, Weigang Pang, Lan College of Information Science and Engineering Northeastern University Shenyang 110819 China Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong State Key Laboratory of Advanced Optical Communication Systems and Networks Peking University Beijing 100871 China

In optical Wavelength-Division-Multiplexing (WDM) networks, multicast becomes more and more popular to provide high-speed communication between one point and multiple points. At the same time, the ports of Optical Cross-Connect (OXC) are greatly enhanced with the increasing number of wavelengths in fibers, and then the waveband switching technique is proposed to save the ports and reduce the cost of OXC. However, current waveband grooming algorithms are all limited in unicast. To achieve the multicast communication and meanwhile save the ports of OXC, we need to solve the multicast grooming, routing and wavelength/waveband assignment problem which is the HP-hard. In this paper, we propose a heuristic algorithm named Integrated Multicast Waveband Grooming (IMWG) based on Multicast Layered Auxiliary Graph (MLAG) that includes a Virtual Topology Layer (VTL) and multiple Waveband-Plane Layers (WPLs) to support the single-hop, multi-hop and hybrid multicast waveband grooming. For each demand, IMWG first computes a single-hop or multi-hop grooming waveband-tree on VTL. If the grooming waveband-tree cannot be found on VTL, IMWG computes a new waveband-tree on WPL. If the new waveband-tree cannot be found on WPL, IMWG computes a hybrid grooming waveband-tree on MLAG. Simulation results show that, compared with other algorithms, IMWG is able to obtain better performances. © 2010 IEEE.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

Integration of global and local information in videos for key frame extraction 11

Integration of global and local information in videos for ke...

引用

11th IEEE International Conference on information Reuse and Integration, IRI 2010

作者： Liu, Dianting Shyu, Mei-Ling Chen, Chao Chen, Shu-Ching Department of Electrical and Computer Engineering University of Miami Coral Gables FL 33124 United States Distributed Multimedia Information Systems Laboratory School of Computing and Information Sciences Florida International University Miami FL 33199 United States

ISBN: (纸本)9781424480975

Key frame extraction methods aim to obtain a set of frames that can efficiently represent and summarize video contents and be reused in many video retrieval-related applications. An effective set of key frames, viewed as a high-quality summary of the video, should include the major objects and events of the video, and contain little redundancy and overlapped content. In this paper, a new key frame extraction method is presented, which not only is based on the traditional idea of clustering in the feature extraction phase but also effectively reduces redundant frames using the integration of local and global information in videos. Experimental results on the TRECVid 2007 test video dataset have demonstrated the effectiveness of our proposed key frame extraction method in terms of the compression rate and retrieval precision. © 2010 IEEE.

关键词： Integration

来源：评论

学校读者我要写书评

暂无评论

A simulation framework for the analysis of TLB behavior in virtualized environments

A simulation framework for the analysis of TLB behavior in v...

引用

18th Annual IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication systems, MASCOTS 2010

作者： Venkatasubramanian, Girish Figueiredo, Renato J. Illikkal, Ramesh Newell, Donald Advanced Computing and Information Systems Laboratory University of Florida Gainesville FL United States Intel Corporation 2111 N.E. 25th Avenue Hillsboro OR United States

ISBN: (纸本)9780769541976

Due to the rising importance of virtualization, extensive efforts have gone into determining and improving the performance of workloads on virtualized platforms. This has resulted in a series of modifications to the leading architecture used in virtualized systems (x86) by adding hardware support for virtualization, the latest of which is the addition of tags and tag comparators to the x86 TLB. In this context, it is necessary to have a thorough understanding of the TLB behavior of virtualized workloads and understand the change in this behavior with TLB related architectural parameters. One way of obtaining this understanding is by conducting a simulation-based study of the interaction of various micro-architectural parameters and their effect on the TLB behavior. However, the lack of suitable simulation frameworks makes such a study daunting. In this paper, we present a full-system simulation framework which is suitable for conducting such studies. We first motivate the need for TLB modeling in virtualized systems. Then, we present the framework, develop and validate a timing model for the TLB and evaluate the simulation speed when this model is used. Using the timing model, the influence of the TLB on workload performance is examined for a variety of single and multi-domain workloads and compared with equivalent non-virtualized workloads. It is found that the performance of virtualized workloads, in terms of instructions per cycle (IPC), can vary by 1% to 35% due to the TLB and that this IPC variation can be as much as 9 times the variation in nonvirtualized workloads. © 2010 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Towards Collaborative Research and Education in Computer Architecture with the Archer System

Towards Collaborative Research and Education in Computer Arc...

引用

International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication systems (MASCOTS)

作者： Girish Venkatasubramanian David Isaac Wolinsky Renato J. Figueiredo Advanced Computing and Information Systems Laboratory University of Florida Gainesville FL USA

Archer is a simulation environment and computing resource for research in the field of computer architecture. Archer facilitates the creation of an on-demand computing grid, the deployment of simulation tools on this grid and the batch scheduling of large-scale simulation jobs on this grid. These features enable the use of Archer for simulation-based research as well as dissemination of tools and results among multiple research groups. This paper overviews and reports our experience in the use of Archer for collaborative research and for education.

关键词： Computational modeling Computer architecture Collaboration Software Computers Tutorials Education

来源：评论

学校读者我要写书评

暂无评论

Self-Caring IT systems: A Proof-of-Concept Implementation in Virtualized Environments

Self-Caring IT Systems: A Proof-of-Concept Implementation in...

引用

IEEE International Conference on Cloud computing Technology and Science (CloudCom)

作者： Selvi Kadirvel Jose A.B. Fortes Advanced Computing and Information Systems Laboratory University of Florida Gainesville FL USA

In self-caring IT systems, faults are handled proactively, e.g. by slowing down the deterioration of system health thereby effectively avoiding or delaying system failures. This requires health management which entails health monitoring, diagnosis, prognosis, planning of recovery and remediation actions. A brief overview of our prior work, which proposes a general methodology to capture system properties and incorporate health management using Petri nets, is provided. We describe in detail an application of the proposed formal method to the design and development of middleware that can manage the health of a batch-based, job submission system on a virtualized platform. First, we describe how a real world job submission IT system is converted to a Petri net model. Secondly, we show system validation and analysis using this model to understand resource needs of different activities in the IT chain. Thirdly, we describe how the executable model is used as a system manager to control operation and health management of a virtualized test bed. Fourthly, we illustrate the use of a feedback controller to manage health deterioration due to resource depletion in the job-execution stage of the modeled IT chain. Using a proof-of-concept implementation, we show that the early detection and handling of health deteriorations results in significant benefits in terms of cost savings and down time reduction. Experimental results show that our health management framework can be used to effectively prevent job failures, while imposing low overhead to the managed system. We have shown that for a typical workload consisting of jobs that suffer from potential resource depletion faults, our feedback controller can be used to gain useful life that is needed for critical planning and remediation actions in up to 82% of the jobs.

关键词： Petri nets Analytical models Planning Adaptive control Availability Delay Virtual machining

来源：评论

学校读者我要写书评

暂无评论

Techniques for low-latency proxy selection in wide-area P2P networks

Techniques for low-latency proxy selection in wide-area P2P ...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Arijit Ganguly P. Oscar Boykin Renato Figueiredo Advanced Computing and Information Systems Laboratory University of Florida Gainesville FL USA

ISBN: (纸本)9781424465330

Connectivity constraints due to Internet route outages and symmetric NATs create situations when direct communication is not possible between nodes in P2P deployments, often leading to high latency between high-traffic nodes. In such cases, it is possible to reduce end-to-end latency by routing their communication through another node in the P2P system that is selected based on its Internet latencies to end-nodes. In this paper, we present and compare two decentralized algorithms for discovering low-latency proxy nodes between high-traffic nodes: (1) selecting a node with least Internet latency from the set of randomly-chosen neighbors to which one of the end-nodes is directly connected, and (2) discovery using latency estimates based on network coordinates. We evaluate these techniques in context of IP-over-P2P virtual networks through experiments on realistic wide-area testbeds. Our results indicate that in a network with over 400 nodes on PlanetLab, both the techniques select proxies such that the median penalties over the global optimal are within 16% and 21%, respectively, when all nodes are able to serve as proxies. We also investigate scenarios where subsets of nodes have connectivity constraints preventing them from serving as proxies.

关键词： Delay Network address translation IP networks Routing Internet Computer networks information systems Laboratories Knowledge management Computer network management

来源：评论

学校读者我要写书评

暂无评论

A multimedia data management approach with GeM-Tree

引用

Journal of multimedia 2010年第4期5卷 302-309页

作者： Chatterjee, Kasturi Chen, Shu-Ching Distributed Multimedia Information Systems Laboratory School of Computing and Information Sciences Florida International University Miami FL 33199 United States State Key Laboratory of Software Engineering Wuhan University 430072 China

In this paper, we propose a multimedia data management framework using GeM-Tree. GeM-Tree is a multidimensional tree-based index structure which provides a generalized framework to organize and retrieve images and videos seamlessly. In addition to supporting different multimedia data types and diverse representations, the proposed data management framework supports varied multimedia retrieval strategies like content-based image and video retrieval, mixed multimedia data retrieval where crosssimilarity between images and videos is considered, regionbased retrieval, etc. The framework embeds a high-level semantic relationship between multimedia data objects with a construct called Hierarchical Markov Model Mediator via a novel affinity promotion technique to improve query result relevance manifold. Extensive experiments were conducted with different multimedia data types possessing varied representations, different retrieval approaches, and different data sizes. The encouraging results demonstrate a potential solution to the important and complex issue of managing a large volume of multimedia data. © 2010 Academy Publisher.

关键词： Content based retrieval

来源：评论

学校读者我要写书评

暂无评论

A Simulation Framework for the Analysis of the TLB Behavior in Virtualized Environments

A Simulation Framework for the Analysis of the TLB Behavior ...

引用

International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication systems (MASCOTS)

作者： Girish Venkatasubramanian Renato J. Figueiredo Ramesh Illikkal Donald Newell Advanced Computing and Information Systems Laboratory University of Florida Gainesville FL USA Intel Corporation Hillsboro OR USA

Due to the rising importance of virtualization, extensive efforts have gone into determining and improving the performance of workloads on virtualized platforms. This has resulted in a series of modifications to the leading architecture used in virtualized system (x86) by adding hardware support for virtualization, the latest of which is the addition of tags and tag comparators to the x86 TLB. In this context, it is necessary to have a thorough understanding of the TLB behavior of virtualized workloads and understand the change in this behavior with TLB related architectural parameters. One way of obtaining this understanding is by conducting a simulation-based study of the interaction of various micro-architectural parameters and their effect on the TLB behavior. However, the lack of suitable simulation frameworks makes such a study daunting. In this paper, we present a full-system simulation framework which is suitable for conducting such studies. We first motivate the need for TLB modeling in virtualized systems. Then, we present the framework, develop and validate a timing model for the TLB and evaluate the simulation speed when this model is used. Using the timing model, the influence of the TLB on workload performance is examined for a variety of single and multi-domain workloads and compared with equivalent non-virtualized workloads. It is found that the performance of virtualized workloads, in terms of instructions per cycle (IPC), can vary by 1% to 35% due to the TLB and that this IPC variation can be as much as 9 times the variation in non-virtualized workloads.

关键词： Timing Data models Servers Pipelines Computational modeling Virtual machine monitors Context

来源：评论

学校读者我要写书评

暂无评论

On the Use of Machine Learning to Predict the Time and Resources Consumed by Applications 10

On the Use of Machine Learning to Predict the Time and Resou...

引用

IEEE/ACM International Symposium on Cluster computing and the Grid (CCGRID)

作者： Andréa Matsunaga José A.B. Fortes Advanced Computing and Information Systems Laboratory Department of Electrical and Computer Engineering University of Florida Gainesville FL USA

ISBN: (纸本)9780769540399

Most data centers, clouds and grids consist of multiple generations of computing systems, each with different performance profiles, posing a challenge to job schedulers in achieving the best usage of the infrastructure. A useful piece of information for scheduling jobs, typically not available, is the extent to which applications will use available resources once they are executed. This paper comparatively assesses the suitability of several machine learning techniques for predicting spatio temporal utilization of resources by applications. Modern machine learning techniques able to handle large number of attributes are used, taking into account application- and system-specific attributes (e.g., CPU micro architecture, size and speed of memory and storage, input data characteristics and input parameters). The work also extends an existing classification tree algorithm, called Predicting Query Runtime (PQR), to the regression problem by allowing the leaves of the tree to select the best regression method for each collection of data on leaves. The new method (PQR2) yields the best average percentage error, predicting execution time, memory and disk consumption for two bioinformatics applications, BLAST and RAxML, deployed on scenarios that differ in system and usage. In specific scenarios where usage is a non-linear function of system and application attributes, certain configurations of two other machine learning algorithms, Support Vector Machine and k-nearest neighbors, also yield competitive results. In addition, experiments show that the inclusion of system performance and application-specific attributes also improves the performance of machine learning algorithms investigated.

关键词： Machine learning Machine learning algorithms Processor scheduling Regression tree analysis Mesh generation Cloud computing Grid computing Classification tree analysis Classification algorithms Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：