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

6th International Conference on parallel (PaCT 2001)

作者： Trivedi, Nishank Bischof, Jared Davis, Steve Pedretti, Kevin Scheetz, Todd E. Braun, Terry A. Roberts, Chad A. Robinson, Natalie L. Sheffield, Val C. Soares, M.Bento Casavant, Thomas L. Parallel Processing Laboratory Department of Electrical and Computer Engineering University of Iowa Iowa City IA 52242 United States

This paper describes the UIcluster software tool, which partitions expressed sequence tag (EST) sequences and other genetic sequences into "clusters" based on sequence similarity. Ideally, each cluster will contain sequences that all represent the same gene. UIcluster has been developed over the course of 4 years to solve this problem efficiently and accurately for large data sets consisting of tens or hundreds of thousands of EST sequences. The latest version of the application has been parallelized using the MPI standard. Both the computation and memory requirements of the program can be distributed among multiple (possibly distributed) UNIX processes. © 2002 Elsevier Science B.V. All rights reserved.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Using run-time uncertainty to robustly schedule parallel computation 4th

Using run-time uncertainty to robustly schedule parallel com...

引用

4th International Conference on parallel Computing Technologies, PaCT 1997

作者： Dietz, R.D. Casavant, T.L. Scheetz, T.E. Braun, T.A. Andersland, M.S. Parallel Processing Laboratory Electrical and Computer Engineering Department The University of Iowa Iowa CityIA52242 United States

ISBN: (纸本)3540633715

Increasingly, feedback of measured run-time information is being used in the optimization of computation execution. Because of this, the need for a model relating the static view of a computation to its runtime variance is becoming more important. Recently, we have described such a model which uses the notion of uncertainty to provide bounds on key scheduling parameters of the run-time computation. In this paper, we demonstrate how our model provides a foundation for robust parallel scheduling, i.e., scheduling that optimizes for computation execution in the presence of run-time variance. While this work was inspired by our previous study of uncertainty due to measurement intrusion, the scheduling paradigm presented here represents a broader, more general application of the uncertainty concept. © Springer-Verlag Berlin Heidelberg 1997.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Live updating operating systems using virtualization 06

Live updating operating systems using virtualization

引用

VEE 2006 - 2nd International Conference on Virtual Execution Environments

作者： Chen, Haibo Chen, Rong Zhang, Fengzhe Zang, Binyu Yew, Pen-Chung Parallel Processing Institute Fudan University China Department of Computer Science and Engineering University of Minnesota Twin-Cities United States

ISBN: (纸本)9781595933324

Many critical IT infrastructures require non-disruptive operations. However, the operating systems thereon are far from perfect that patches and upgrades are frequently applied, in order to close vulnerabilities, add new features and enhance performance. To mitigate the loss of availability, such operating systems need to provide features such as live update through which patches and upgrades can be applied without having to stop and reboot the operating system. Unfortunately, most current live updating approaches cannot be easily applied to existing operating systems: some are tightly bound to specific design approaches (e.g. object-oriented);others can only be used under particular circumstances (e.g. quiescence states). In this paper, we propose using virtualization to provide the live update capability. The proposed approach allows a broad range of patches and upgrades to be applied at any time without the requirement of a quiescence state. Moreover, such approach shares good portability for its OS-transparency and is suitable for inclusion in general virtualization systems. We present a working prototype, LUCOS, which supports live update capability on Linux running on Xen virtual machine monitor. To demonstrate the applicability of our approach, we use real-life kernel patches from Linux kernel 2.6.10 to Linux kernel 2.6.11, and apply some of those kernel patches on the fly. Performance measurements show that our implementation incurs negligible performance overhead: a less than 1 % performance degradation compared to a Xen-Linux. The time to apply a patch is also very minimal. Copyright © 2006 ACM.

关键词： computer operating systems

来源：评论

学校读者我要写书评

暂无评论

Reducing cache contention in a multi-core processor via a scheduler

Reducing cache contention in a multi-core processor via a sc...

引用

International Conference on Advanced computer Theory and engineering

作者： Shekofteh, S. Kazem Deldari, Hossein Khalkhali, Maryam Baradaran Parallel and Distributed Processing Lab. Department of Computer Engineering Ferdowsi University of Mashhad Mashhad Iran Department of Computer Engineering Islamic Azad University Mashhad Branch Mashhad Iran

ISBN: (纸本)9781424465408

Multi-core architectures, which have multiple processing units on a single chip, are widely viewed as a way to achieve higher processor performance. Well scheduling of running threads on these processors will result in achieving higher performance. Modern multi-core systems are designed to allow clusters of cores to share various hardware structures, such as last-level caches, memory controllers, and interconnections, as well as prefetching hardware. Without considering these shared resources, scheduling the threads will cause serious degradation in overall performance of the system. In this paper we propose a novel algorithm to schedule the threads that considers these potential contentions to keep away from. The simulation results showed that the proposed scheduler would avoid from lots of contentions between threads on various resources especially on shared caches. © 2010 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Control flow obfuscation with information flow tracking 42

Control flow obfuscation with information flow tracking

引用

42nd Annual IEEE/ACM International Symposium on Microarchitecture, Micro-42

作者： Chen, Haibo Yuan, Liwei Wu, Xi Zang, Binyu Huang, Bo Yew, Pen-Chung Parallel Processing Institute Fudan University China Intel China Software Center China Department of Computer Science and Engineering University of Minnesota United States

ISBN: (纸本)9781605587981

Recent micro-architectural research has proposed various schemes to enhance processors with additional tags to track various properties of a program. Such a technique, which is usually referred to as information flow tracking, has been widely applied to secure software execution (e.g., taint tracking), protect software privacy and improve performance (e.g., control speculation). In this paper, we propose a novel use of information flow tracking to obfuscate the whole control flow of a program with only modest performance degradation, to defeat malicious code injection, discourage software piracy and impede malware analysis. Specifically, we exploit two common features in information flow tracking: the architectural support for automatic propagation of tags and violation handling of tag misuses. Unlike other schemes that use tags as oracles to catch attacks (e.g., taint tracking) or speculation failures, we use the tags as flow-sensitive predicates to hide normal control flow transfers: the tags are used as predicates for control flow transfers to the violation handler, where the real control flow transfer happens. We have implemented a working prototype based on Itanium processors, by leveraging the hardware support for control speculation. Experimental results show that BOSH can obfuscate the whole control flow with only a mean of 26.7% (ranging from 4% to 59%) overhead on SPECINT2006. The increase in code size and compilation time is also modest. Copyright 2009 ACM.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Pillow talks: Bits over communications in WLAN 2

Pillow talks: Bits over communications in WLAN

引用

2nd Workshop for Mobile Sensing, Computing and Communication, MSCC 2015

作者： Dong, Xuan Zhu, Chunsheng Lv, Shaohe Wang, Lei Wang, Xiaodong Leung, Victor C.M. National Laboratory of Parallel and Distributed Processing National University of Defense Technology United States Department of Electrical and Computer Engineering University of British Columbia Canada Department of Network Engineering Dalian University of Technology China

ISBN: (纸本)9781450335188

Improving the channel utilization is a significant issue to enhance the performance in WLAN. This paper presents, Pillow Talks MAC (PT-MAC), a novel spectrum sharing mechanism to create an extra channel (pt-channel) for client- to-client transmission in WLAN. Obviously, The basic chal- lenge in our proposal is how pt-channel works concurrently and transparently with AP transmissions. To address the issue, in PT-MAC, selected clients are allowed to contend for pt-channel during uplink transmissions and talk freely under the ongoing downlink transmissions. Based on ad- vanced physical techniques, pt-channel transmitter receives and forwards the AP signals simultaneously within OFDM cyclic prefix, resulting in mixed signals are overheard by re- ceiver in pt-channel. However, the mixed message can be re- covered by pt-decoding system. Simulations and analytical results show that, PT-MAC reuses the spectrum in WLAN and achieves a throughput gain as large as 92% with similar fairness, when the ratio of downlink traffic is about 80%. © 2015 ACM.

关键词： Wireless local area networks (WLAN)

来源：评论

学校读者我要写书评

暂无评论

A continuous stream service and high service availability mechanism for continuous media servers

A continuous stream service and high service availability me...

引用

6th International Conference on Advanced Communication Technology: Broadband Convergence Network Infrastructure

作者： Jung, Sung-In Lee, Cheol-Hoon Computer System Division Electron./Telecom. Res. Institute Daejon Korea Republic of Parallel Processing Laboratory Department of Computer Engineering Chungnam National University Daejon Korea Republic of

ISBN: (纸本)8955191197

Due to the explosive growth of the Internet, stream services are becoming more popular. The large media servers supporting thousands of concurrent media streams have to satisfy us with both good throughout and high availability. Although they are reciprocal from the viewpoint of system performance, the stream service continuity, as well as throughput, should be considered in clustered media servers. This is because media stream services should be continuously available to the clients even on the event of system failure. In this paper, we introduce service availability as the gauge of service degree on media servers, and present the basic scheme for guaranteeing continuous stream service. To do this, we propose LSS(Log Stream Status) and RRD(Ready Resource for instant Delivery) mechanisms. They are classified according to the status management method of stream service and the resumption method of closed service. Although these mechanisms require additional overhead, we found that they can be applied to clustered media servers with minimum overhead. Additionally, we concluded that they can provide higher quality of service availability on traditional clustered media servers.

关键词： Servers

来源：评论

学校读者我要写书评

暂无评论

A resource broker for computing nodes selection in grid computing environments 3rd

引用

3rd International Conference on Grid and Cooperative Computing, GCC2004

作者： Yang, Chao-Tung Lai, Chuan-Lin Shih, Po-Chi Li, Kuan-Ching High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung407 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Shalu Taichung433 Taiwan

ISBN: (纸本)3540235647

As Grid Computing is becoming a reality, there is a need for managing and monitoring the available resources worldwide, as well as the need for conveying these resources to the everyday user. This paper describes a resource broker with its main function as to match the available resources to the user’s needs. The use of the resource broker provides a uniform interface to access any of the available and appropriate resources using user’s credentials. The resource broker runs on top of the Globus Toolkit. Therefore, it provides security and current information about the available resources and serves as a link to the diverse systems available in the Grid. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Cooperative spectrum sharing in relay-trading mode: A fairness view

Cooperative spectrum sharing in relay-trading mode: A fairne...

引用

4th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2012

作者： Liu, Lixia Hu, Gang Xu, Ming Peng, Yuxing National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China Department of Networks Engineering School of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769548104

In the relay-trading mode of wireless cognitive radio networks the secondary user (SU) can achieve a promised spectrum access opportunity by relaying for the primary user (PU). How to utilize the exchanged resource efficiently and fairly is an interesting and practical problem. In this paper we proposed a cooperative spectrum sharing strategy (RT-CSS) for the relay-trading mode from the fairness view. The cooperative SUs are gathered in a cooperative sharing group (CSG), and contribution metric (CM) is proposed to measure each CSG member's contribution to CSG as well as benefit from CSG. The adjustment of CM can guarantee the fairness and efficiency of spectrum sharing. The numerical simulation shows that RT-CSS can achieve better performance than the sense-uncooperative mode. © 2012 IEEE.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

TextNet - A text-based intelligent system

引用

Natural Language engineering 1997年第2期3.0卷 171-190页

作者： Harabagiu, Sanda M. Moldovan, Dan I. Parallel Knowledge Processing Laboratory University of Southern California Los Angeles CA 90089-2562 United States Department of Computer Science and Engineering Southern Methodist University Dallas TX 75275-0122 United States

A large collection of texts may be reached through the Internet and this provides a powerful platform from which common-sense knowledge may be gathered. This paper presents a system that contains a core knowledge base structured around WordNet, a lexical database, capable of extracting contextual information from a given input text. Such context information is then used to retrieve other texts from the Internet that relate to that context. When processed by the system, these new texts bring more information that represents an enhanced domain context for the initial text. This is an incremental method for text processing that acquires domain knowledge from other texts. The paper describes the system architecture, its core knowledge base and inference engine, and the acquisition of new knowledge from corpora. © 1997, Cambridge University Press. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：