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

IEEE International Conference on systems, Man and Cybernetics

作者： M. Ahamed H. Eldeeb S. Nassar N. Bagherzadeh Computer Science Mathematics Department Faculty of Science Cairo University Cairo Egypt Electrical and Computer Engineering University of California Irvine Irvine CA USA Computer & Control Department Electronic Research Institute Head of Parallel and Distributed Systems team Cairo Egypt Chair of Electrical and Computer Engineering University of California Irvine Irvine CA USA

We develop a new software layer called the Automatic parallel Detection Layer (APDL) for the automatic transformation from sequential to parallel code. The main interest, in this research, is the parallelism at loop level, because significant parallelism in programs almost invariably occurs in loops. The proposed APDL has five processes for code transformation: the sequential source code parser, data dependence analysis of this code, partitioning, scheduling both task and data, and generating parallel source code. Many cases have been studied to evaluate the performance of the developed layer. The performance is evaluated depending on the execution time of: the sequential code, the parallel programmer code, and the code output from APDL for the same case study. Performance results show that APDL greatly improves the execution time with respect to sequential execution time, and saves on the high cost of a parallel programmer.

关键词： parallel processing Concurrent computing Programming profession Electronic mail Program processors distributed computing High performance computing computer science Automatic control parallel programming

来源：评论

学校读者我要写书评

暂无评论

Runtime support for type-safe dynamic Java classes 14th

引用

14th European Conference on Object-Oriented Programming, ECOOP 2000

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

ISBN: (纸本)3540676600

Modern software must evolve in response to changing condi- tions. In the most widely used programming environments, code is static and cannot change at runtime. This poses problems for applications that have limited down-time. More support is needed for dynamic evolution. In this paper we present an approach for supporting dynamic evolution of Java programs. In this approach, Java programs can evolve by changing their components, namely classes, during their execution. Changes in a class lead to changes in its instances, thereby allowing evolution of both code and state. The approach promotes compatibility with existing Java applications, and maintains the security and type safety controls imposed by Java's dynamic linking mechanism. Experimental analyses of our implementation indicate that the implementation imposes a moderate performance penalty relative to the unmodified virtual machine. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Secure execution of mobile programs

Secure execution of mobile programs

引用

DARPA Information Survivability Conference and Exposition, DISCEX 2000

作者： Pandey, R. Hashii, B. Lal, M. Parallel and Distributed Computing Laboratory Computer Science Department University of California DavisCA95616 United States

ISBN: (纸本)0769504906

There is increasing interest in computing models that support extensibility of systems through code migration. Although appealing both from the system design and extensibility points of view, extensible systems are vulnerable to an external program's aberrant execution behaviors. We examine the problems of resource access control and resource consumption. We propose solutions for these problems and analyze their effectiveness. © 2000 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Partitioning parallel simulation of wireless networks

Partitioning parallel simulation of wireless networks

引用

Simulation Winter Conference

作者： A. Boukerche A. Fabbri Parallel Simulation and Distributed Systems PARADISE Research Laboratory Department of Computer Science University of North Texas Denton TX USA

We present a simulation testbed for wireless and mobile telecommunication systems, a two-stage PCS parallel simulation testbed which makes use of a conservative scheme at stage 1, and of time warp at stage 2. While time warp is considered to be an effective synchronization mechanism in parallel and distributed discrete event simulation (PDES) it is also well known for its instability due to rollbacks and its devastating effect, i.e., series of cascading rollbacks, among other factors. Thus, our primary goal is to study the impact and the importance of partitioning in our PCS model while reducing significantly the number of rollbacks.

关键词： Wireless networks Personal communication networks Time warp simulation Computational modeling System testing Solid modeling Telecommunication traffic Traffic control Memory management computer simulation

来源：评论

学校读者我要写书评

暂无评论

LOAD BALANCING FOR parallel PCS NETWORK SIMULATIONS

引用

Journal of Interconnection Networks 2000年第3期1卷 173-193页

作者： AZZEDINE BOUKERCHE Parallel Simulations and Distributed Systems (PARADISE) Research Laboratory Department of Computer Sciences University of North Texas Denton TX 76203 USA

parallel and distributed simulation techniques have been investigated in a number of studies to decrease the execution times of PCS network simulations. In this paper, we consider distributed simulation of PCS models using a two-state PCS simulation testbed which makes use of a conservative scheme at Stage 1, and of Time Warp at Stage 2, and focus upon the load balancing issue. We investigate and study several load balancing schemes for TDMA systems. Extensive simulation experiments were conducted on a cluster of workstations using a real suburban area serviced by an FCA-based PCS networks. Our results indicate clearly that careful load balancing scheme is important in the success of the PCS simulation model.

关键词： PCS Wireless Networks Time Warp Partitioning parallel Simulation

来源：评论

学校读者我要写书评

暂无评论

T3C: a temporally correct concurrency control algorithm for distributed databases

T3C: a temporally correct concurrency control algorithm for ...

引用

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

作者： A. Boukerche T.W. Tuck Parallel Simulations and Distributed Systems (PARADISE) Research Laboratory Department of Computer Science University of North Texas Denton TX USA

In some scenarios involving online transaction processing within a distributed database, it is desirable to synchronize transactions in a manner that guarantees conflict equivalence with a serial schedule ordered by original transaction start times while providing each transaction with an anomaly-serializable isolation. Few theoretical concurrency control algorithms guarantee such a conflict equivalence, and we are unaware of any protocol that accomplishes this while supporting real-world issues such as out-of-order transaction messages, out-of-order operation executions and out-of-order transaction committals without the burden of explicit read-set and write-set declarations. We describe an algorithm called T3C (Temporally Correct Concurrency Control) that provides this guarantee and supports these issues while requiring only table-level write-set declarations.

关键词： Concurrency control distributed databases Transaction databases Processor scheduling Protocols Out of order Concurrent computing Partitioning algorithms Computational modeling computer science

来源：评论

学校读者我要写书评

暂无评论

Secure execution of mobile programs

Secure execution of mobile programs

引用

DARPA Information Survivability Conference & Exposition

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

关键词： Operating systems Kernel Concurrent computing computer science Internet Communication system security Government Laboratories Read only memory Java

来源：评论

学校读者我要写书评

暂无评论

Scalable resource control in active networks 2

Scalable resource control in active networks

引用

2nd International Working Conference on Active Networks, IWAN 2000

作者： Anagnostakis, Kostas G. Hicks, Michael W. Ioannidis, Sotiris Keromytis, Angelos D. Smith, Jonathan M. Distributed Systems Laboratory Department of Computer and Information Science University of Pennsylvania 200 S. 33rd Street PhiladelphiaPA19104-6389 United States

ISBN: (纸本)3540411798

The increased complexity of the service model relative to store-and-forward routers has made resource management one of the paramount concerns in active networking research and engineering. In this paper, we address two major challenges in scaling resource management to many-node active networks. The first is the use of market mechanisms and trading amongst nodes and programs with varying degrees of competition and cooperation to provide a scalable approach to managing active network resources. The second is the use of a trust-management architecture to ensure that the participants in the resource management marketplace have a policy-driven "rule of law" in which marketplace decisions can be made and relied upon. We have used lottery scheduling and the Keynote trust-management system for our implementation, for which we provide some initial performance indications. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Load balancing study in PCS wireless networks

Load balancing study in PCS wireless networks

引用

International Conference on parallel Processing Workshops (ICPPW)

作者： A. Boukerche A. Fabbri Parallel Simulations and Distributed Systems (PARADISE) Research Laboratory Department of Computer Scienceu University of North Texas USA

Wireless networking technologies and mobile cellular communication systems are growing at an ever faster rate, and this is likely to continue in the foreseeable future. Higher reliability, better coverage and services, higher capacity, mobility management, and wireless multimedia are all parts of the potpourri. The evolution of new systems and improved designs will always depend on the ability to predict system performance using analytical or simulation methods. To date, mathematical analysis has brought some insight into the design of such systems, but analytical methods are often not general or detailed enough for evaluation and comparison of various proposed mobile and/or wireless systems and their services. distributed simulation techniques have been investigated in a number of studies to decrease the execution times of PCS simulations. We study the load balancing problem for PCS wireless simulation systems, and focus upon static strategies in order to reduce the synchronization overhead of SWiMNet, a parallel PCS simulation testbed developed at UNT.

关键词： Load management Personal communication networks Wireless networks Cellular networks Telecommunication network reliability Mobile radio mobility management System performance Performance analysis Analytical models Predictive models

来源：评论

学校读者我要写书评

暂无评论

Filtering and scalability in the ECO distributed event model

Filtering and scalability in the ECO distributed event model

引用

IEEE International Workshop on Software Engineering for parallel and distributed systems

作者： Haahr Meier Nixon Cahill Jul Distributed Systems GroupDepartment of Computer Science Trinity College Dublin Ireland Distributed Systems Laboratory Department of Computer Science University of Copenhagen Denmark

Event-based communication is useful in many application domains, ranging from small centralised applications to large distributed systems. Many different event models have been developed to address the requirements of different application domains. One such model is the ECO (events, constraints, objects) model, which was designed to support distributed virtual world applications. Like many other event models, ECO has event-filtering capabilities that are meant to improve scalability by decreasing the network traffic in a distributed implementation. Our recent work in event-based systems has included building a fully-distributed version of the ECO model, including event-filtering capabilities. This paper describes the results of our evaluation of filters as a means of achieving increased scalability in the ECO model. The evaluation is empirical, and real data gathered from an actual event-based system is used. The findings show that: (i) filters are highly valuable in making distributed implementations of the model scale, (ii) multicasting contributes to the scalability and, perhaps most significantly, (iii) multicast groups can be dynamically generated from filters using local (per-node) knowledge rather than global knowledge of the distributed application.

关键词： Filters

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：