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

Proceedings of the 14th international conference on Supercomputing

作者： X. Shen W. Liao A. Choudhary G. Memik M. Kandemir S. More G. Thiruvathukal A. Singh Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL Department of Computer Science and Engineering The Pennsylvania State University University Park PA School of Computing Telecommunications and Information Sciences JHPC Laboratory Depaul University

Our results demonstrate that our novel application development environment provides both ease-of-use and high performance for large-scale, I/O-intensive scientific applications.

ISBN: (纸本)9781581132700

Our results demonstrate that our novel application development environment provides both ease-of-use and high performance for large-scale, I/O-intensive scientific applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Providing fine-grained access control for Java programs via binary editing

引用

Concurrency and Computation: Practice and Experience 2000年第14期12卷

作者： Raju Pandey Brant Hashii Parallel and Distributed Computing Laboratory Computer Science Department University of California Davis CA 95616 U.S.A.

There is considerable interest in programs that can migrate from one host to another and execute. Mobile programs are appealing because they support efficient utilization of network resources and extensibility of information servers. However, since they cross administrative domains, they have the ability to access and possibly misuse a host's protected resources. In this paper, we present a novel approach for controlling and protecting a site's resources. In this approach, a site uses a declarative policy language to specify a set of constraints on accesses to resources. A set of code transformation tools enforces these constraints on mobile programs by integrating the access constraint checking code directly into the mobile program and resource definitions. Using this approach, a site does not need to explicitly include calls to reference monitors in order to protect resources. The performance analysis show that the approach performs better than reference monitor-based approaches in many cases. Copyright © 2000 John Wiley & Sons, Ltd.

关键词： security policy mobile code access control Java object orientation binary editing

来源：评论

学校读者我要写书评

暂无评论

Providing dynamic and customizable caching policies 2

Providing dynamic and customizable caching policies

引用

2nd USENIX Symposium on Internet Technologies and Systems, USITS 1999

作者： Barnes, J. Fritz Pandey, Raju Parallel and Distributed Computing Laboratory Computer Science Department University of California DavisCA95616 United States

Web caching has emerged as one solution for improving client latency on the web. Cache effectiveness depends on the policies used to route requests to other caches and servers, to maintain up-to-date web objects and to remove objects from the cache. Traditional caches apply one set of policies, which determines the efficiency as well as the effectiveness of the caches. This set of policies often does not exploit the diversity inherent in different web objects, caches and clients. Policies that do exploit this diversity result in convoluted caching policies that attempt to combine multiple policies and guess at the unknown characteristics of web objects, caches and clients. In this paper, we present an extensible caching infrastructure in which cache administrators, servers, and end users can customize how web objects are cached, replaced, and kept consistent. The infrastructure includes a domain-specific language, CacheL, for defining customizable caching policies that can be changed dynamically. Analysis of our prototype, PoliSquid, shows the benefits of the infrastructure for variable coherency policies, localized removal policies, and early removal of objects from servers. © 1999 by The USENIX Association All Rights Reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CPU resource control for mobile programs 1

CPU resource control for mobile programs

引用

1st International Symposium on Agent Systems and Applications and 3rd International Symposium on Mobile Agents, ASA/MA 1999

作者： Lal, Manoj Pandey, Raju Computer Science Department Parallel and Distributed Computing Laboratory University of California DavisCA95616 United States

ISBN: (纸本)0769503403

There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support efficient utilization of network resources and extensibility of information servers. This paper presents a scheduling scheme for allocating resources to a mix of real-Time and non real-Time mobile programs. Within this framework, both mobile programs and hosts can specify constraints on how CPU should be allocated. On the basis of the constraints, the scheme constructs a scheduling graph on which it applies several scheduling algorithms. In case of conflicts between mobile program and host specified constraints, the schemes implements a policy that resolves the conflicts in favor of the host. The resulting scheduling scheme is adaptive, flexible, and enforces both program and host specified constraints.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A fission technique enabling parallelization of imperfectly nested loops

引用

6th International Conference on High Performance computing, HiPC 1999

作者： Ju, Jialin Chaudhary, Vipin Pacific Northwest National Laboratory Richland WA 99352 United States Parallel and Distributed Computing Laboratory Wayne State University Detroit MI 48202 United States

ISBN: (纸本)3540441271

This paper addresses the issue of parallelizing imperfectly nested loops. Current parallelizing compilers or transformations would either only parallelize the inner-most loop (which is more like vectorization than parallelization), or not parallelize the loops at *** present an approach that transforms an imperfectly nested loop into at most three fully parallel perfectly nested loops. The transformed loops can be parallelized by any parallelizing compiler. The advantage of our technique is the simplicity of the transformed loops and low synchronization overhead. The feasibility of this approach was tested using several types of loops including those from the Eispack math library and from Linpack benchmark on different multi-processor platforms and performance was compared with Sun's MP C and Cray's autotasking. The results show that our method is very effective. © 1999 Springer-Verlag Berlin Heidelberg.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

The visual query language for an object-oriented knowledge-based system

The visual query language for an object-oriented knowledge-b...

引用

1999 International Symposium on Database Applications in Non-Traditional Environments, DANTE 1999

作者： Xu, Ming Wang, Yong-Jun Wang, Yi-Jie Zhang, Kang Zhang, Yanchim National Laboratory for Parallel and Distributed Processing Changsha Hunan410073 China Dept.of Computing Mac Quart e University Sydney Australia University of Southern Queensland Depi of Mathematics and Computing Toowoomba Australia

ISBN: (纸本)0769504965

The user interface of the object-oriented knowledge-based system CAOBS/v1.2 is a visual query subsystem consisting of a flexible visual query language (VKQL), and a knowledge base browser/*** the visual language, the user can express query requirements by constructing query *** absorbs the key features of some existing visual query languages, and adds more advanced *** paper presents the design and implementation of VKQL and compares VKQL with other similar query languages. © 2000 IEEE.

关键词： Knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

Design issues for a high-performance distributed shared memory on symmetrical multiprocessor clusters

引用

Cluster computing 1999年第3期2卷 177-186页

作者： Roy, Sumit Chaudhary, Vipin Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit USA

Clusters of Symmetrical Multiprocessors (SMPs) have recently become the norm for high-performance economical computing solutions. Multiple nodes in a cluster can be used for parallel programming using a message passing library. An alternate approach is to use a software distributed Shared Memory (DSM) to provide a view of shared memory to the application programmer. This paper describes Strings, a high performance distributed shared memory system designed for such SMP clusters. The distinguishing feature of this system is the use of a fully multi-threaded runtime system, using kernel level threads. Strings allows multiple application threads to be run on each node in a cluster. Since most modern UNIX systems can multiplex these threads on kernel level light weight processes, applications written using Strings can exploit multiple processors on a SMP machine. This paper describes some of the architectural details of the system and illustrates the performance improvements with benchmark programs from the SPLASH-2 suite, some computational kernels as well as a full fledged application. It is found that using multiple processes on SMP nodes provides good speedups only for a few of the programs. Multiple application threads can improve the performance in some cases, but other programs show a slowdown. If kernel threads are used additionally, the overall performance improves significantly in all programs tested. Other design decisions also have a beneficial impact, though to a lesser degree.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Evaluation of cluster interconnects for a distributed shared memory

Evaluation of cluster interconnects for a distributed shared...

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： S. Roy V. Chaudhary Parallel and Distributed Computing Laboratory Wayne State University Detroit MI USA

Clusters of Symmetrical Multiprocessors (SMPs) have recently become popular as low-cost, high-performance computing solutions. The type of interconnection hardware used in these clusters can become a deciding factor in their overall performance. This paper evaluates the performance of three different communication systems, 10 Mbps Ethernet, 100 Mbps FastEthernet and 155 Mbps ATM, using a multithreaded distributed Shared Memory system, Strings. The raw performance of each network is first measured using netperf. Ten different applications are then used for performance evaluation, including programs from the SPLASH-2 benchmarks, a medical computing application, and some computational kernels. It is found that half of the programs tested are not significantly affected by changes in the bandwidth. Though the ATM network provides the highest overall bandwidth, the remaining applications show that the increase in latency compared to FastEthernet prevents any performance improvement. On the other hand, applications that require only moderately high bandwidths perform substantially better with FastEthernet.

关键词： Bandwidth distributed computing Programming profession Ethernet networks Asynchronous transfer mode Benchmark testing Biomedical computing Kernel Delay Microprocessors

来源：评论

学校读者我要写书评

暂无评论

CPU resource control for mobile programs

CPU resource control for mobile programs

引用

International Symposium on Agent Systems and Applications. International Symposium on Mobile Agents

作者： M. Lal R. Pandey Parallel and Distributed Computing Laboratory Computer Science Department University of California Davis CA USA

There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support efficient utilization of network resources and extensibility of information servers. This paper presents a scheduling scheme for allocating resources to a mix of real-time and non real-time mobile programs. Within this framework, both mobile programs and hosts can specify constraints on how CPU should be allocated. On the basis of the constraints, the scheme constructs a scheduling graph on which it applies several scheduling algorithms. In case of conflicts between mobile program and host specified constraints, the schemes implement a policy that resolves the conflicts in favor of the host. The resulting scheduling scheme is adaptive, flexible, and enforces both program and host specified constraints.

关键词： Scheduling algorithm Resource management Java Web pages Government Security Concurrent computing Laboratories Computer science Runtime

来源：评论

学校读者我要写书评

暂无评论

The visual query language for an object-oriented knowledge-based system

The visual query language for an object-oriented knowledge-b...

引用

International Symposium on Database Applications in Non-Traditional Environments, DANTE

作者： Ming Xu Yong-Jun Wang Yi-Jie Wang Kang Zhang Yanchun Zhang National Laboratory for parallel and Distributed Processing Changsha Hunan China Department of Computing Macquarie University Sydney Australia Department of Mathematics & Computing University of Southern Queensland Toowoomba Australia

The user interface of the object-oriented knowledge-based system CAOBS/v1.2 is a visual query subsystem consisting of a flexible visual query language (VKQL), and a knowledge base browser/editor. With the visual language, the user can express query requirements by constructing query graphs. VKQL absorbs the key features of some existing visual query languages, and adds more advanced functions. The paper presents the design and implementation of VKQL and compares VKQL with other similar query languages.

关键词： Database languages Knowledge based systems Computer aided software engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：