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

Proceedings of the international symposium on parallel architectures, algorithms and Networks, I-SPAN 1999年 356-361页

作者： Morris, John Univ of Western Australia Nedlands

Dataflow computation models enable simpler and more efficient management of the memory hierarchy - a key barrier to the performance of many parallel programs. This paper enumerates some advantages of using the dataflow model;it argues that the programming model is simple and easily managed by a programmer and demonstrates some of the efficiencies that the dataflow model allows an underlying run-time system to achieve.

关键词： Data flow analysis

来源：评论

学校读者我要写书评

暂无评论

Java4P: Java with high-level concurrency constructs

Proceedings of the International Symposium on Parallel Archi...

引用

Proceedings of the international symposium on parallel architectures, algorithms and Networks, I-SPAN 1999年 328-333页

作者： Nugroho, Lukito E. Sajeev, A.S.M. Monash Univ

While Java has provided a mechanism for concurrent programming implemented as language constructs, it is too rudimentary for most programmers and has certain limitations that make programs unnecessarily complex and prevent fine-grained concurrency. We have implemented Java4P, and extension of the Java language, that offers a simpler concurrency model and overcomes Java's limitations. Threads are no longer associated with thread objects, allowing concurrency at any level of granularity. Thread creation is made implicit and syncronisation is achieve through method guards. Synchronisation specification is separated from the functional specification to provide a parallel programming model closer to sequential programming.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Balinda C++: run-time support for concurrent object-oriented language

Proceedings of the International Symposium on Parallel Archi...

引用

Proceedings of the international symposium on parallel architectures, algorithms and Networks, I-SPAN 1999年 36-41页

作者： Wang, H.C. Yuen, C.K. Feng, M.D. Natl Univ of Singapore Singapore Singapore

Runtime systems are critical to the implementation of concurrent object-oriented programming languages. This paper describes a concurrent object-oriented programming language - Balinda C++, running on a distributed memory system and its runtime implementation. The runtime system is built on the top of the Nexus communication library. The tuplespace is the key of Balinda C++. A distributed tuplespace model is presented to improve data locality. Some experiments have been done to verify our model. The results indicate that our model is effective to improve system performance.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

parallel efficiency: the dataflow advantage

Parallel efficiency: the dataflow advantage

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： J. Morris Centre for Intelligent Information Processing Systems Department of Electrical and Electronic Engineering University of Western Australia Nedlands WA Australia

Dataflow computation models enable simpler and more efficient management of the memory hierarchy - a key barrier to the performance of many parallel programs. This paper enumerates some advantages of using the dataflow model; it argues that the programming model is simple and easily managed by a programmer and demonstrates some of the efficiencies that the dataflow model allows an underlying run-time system to achieve.

关键词： programming profession Costs Memory management parallel processing Hardware Software maintenance Intelligent systems Information processing Data engineering Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Performance and granularity control in the SPaDES parallel simulation system

Performance and granularity control in the SPaDES parallel s...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： Yong-Meng Teo Seng-Chuan Tay School of Computing National University Singapore

parallel simulation has the potential to accelerate the execution of simulation applications. However developing a parallel discrete-event simulation from scratch requires an in-depth knowledge of the mapping process from the physical model to the simulation model, and a substantial effort in optimising performance. This paper presents an overview of the SPaDES (Structured parallel Discrete-Event Simulation) parallel simulation framework. We focus on the performance analysis of SPaDES/C++, an implementation of SPaDES on a distributed-memory Fujitsu AP3000 parallel computer. SPaDES/C++ hides the underlying complex parallel simulation synchronization and parallel programming details from the simulationist. Our empirical results show that the SPaDES framework can deliver good speedup if the process granularity is properly optimised.

关键词： Computational modeling Concurrent computing Read only memory parallel programming Discrete event simulation programming environments Distributed computing Independent component analysis Liver Computer simulation

来源：评论

学校读者我要写书评

暂无评论

Balinda C++: run-time support for concurrent object-oriented language

Balinda C++: run-time support for concurrent object-oriented...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： H.C. Wang C.K. Yuen M.D. Feng School of Computing National University Singapore

Run-time systems are critical to the implementation of concurrent object oriented programming languages. The paper describes a concurrent object oriented programming language, Balinda C++, running on a distributed memory system and its run-time implementation. The run-time system is built on the top of the Nexus communication library. The tuplespace is the key to Balinda C++. A distributed tuplespace model is presented to improve data locality. Some experiments have been done to verify our model. The results indicate that our model is effective at improving system performance.

关键词： Object oriented modeling parallel programming Concurrent computing Yarn Object oriented programming programming profession Runtime library System performance Workstations High performance computing

来源：评论

学校读者我要写书评

暂无评论

Performance and granularity control in the SPaDES parallel simulation system

Proceedings of the International Symposium on Parallel Archi...

引用

Proceedings of the international symposium on parallel architectures, algorithms and Networks, I-SPAN 1999年 94-99页

作者： Teo, Yong-Meng Tay, Seng-Chuan Natl Univ of Singapore Singapore Singapore

parallel simulation has the potential to accelerate the execution of simulation applications. However, developing a parallel discrete-event simulation from scratch requires an in-depth knowledge of the mapping process from the physical model to the simulation model, and a substantial effort in optimising performance. This paper presents an overview of the SPaDES (Structured parallel Discrete-Event Simulation) parallel simulation framework. We focus on the performance analysis of SPaDES/C++, an implementation of SPaDES on a distributed-memory Fujitsu AP3000 parallel computer. SPaDES/C++ hides the underlying complex parallel simulation synchronization and parallel programming details from the simulationist. Our empirical results show that the SPaDES framework can deliver good speedup if the process granularity is properly optimised.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Improvements in parallel job scheduling using gang service

Proceedings of the International Symposium on Parallel Archi...

引用

Proceedings of the international symposium on parallel architectures, algorithms and Networks, I-SPAN 1999年 268-273页

作者： da Silva, Fabricio Alves Barbosa Scherson, Isaac D. Universite Pierre et Marie Curie Paris France

Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. parallel threads of a single job are scheduled for simultaneous execution on a parallel computer even if the job does not fully utilize all available processors. Non allocated processors go idle for the duration of the time quantum assigned to the threads. In this paper we propose a class of scheduling policies, dubbed Concurrent Gang, that is a generalization of gang-scheduling, and allows for the flexible simultaneous scheduling of multiple parallel jobs, thus improving the space sharing characteristics of gang scheduling. However, all the advantages of gang scheduling such as responsiveness, efficient sharing of resources, ease of programming, etc., are maintained.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Java4P: Java with high-level concurrency constructs

Java4P: Java with high-level concurrency constructs

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： L.E. Nugroho A.S.M. Sajeev School of Computer Science and Software Engineering Monash University Australia Department of Computer Science and Software Engineering University of Newcastle Newcastle-upon-Tyne UK

While Java has provided a mechanism for concurrent programming implemented as language constructs, it is too rudimentary for most programmers and has certain limitations that make programs unnecessarily complex and prevent fine-grained concurrency. We have implemented Java4P, an extension of the Java language, that offers a simpler concurrency model and overcomes Java's limitations. Threads are no longer associated with thread objects, allowing concurrency at any level of granularity. Thread creation is made implicit and synchronisation is achieved through method guards. Synchronisation specification is separated from the functional specification to provide a parallel programming model closer to sequential programming.

关键词： Java Concurrent computing Yarn Electrical capacitance tomography programming profession Object oriented modeling Computer science Read only memory Computer languages Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Improvements in parallel job scheduling using gang service

Improvements in parallel job scheduling using gang service

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： F.A.B. da Silva I.D. Scherson Laboratoire ASIM LIP6 Université Pierre et Marie Curie Paris France Department of Information and Computer Science University of California Irvine CA USA

Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. parallel threads of a single job are scheduled for simultaneous execution on a parallel computer even if the job does not fully utilize all available processors. Non allocated processors go idle for the duration of the time quantum assigned to the threads. In this paper we propose a class of scheduling policies, dubbed concurrent gang, that is a generalization of gang-scheduling, and allows for the flexible simultaneous scheduling of multiple parallel jobs, thus improving the space sharing characteristics of gang scheduling. However all the advantages of gang scheduling such as responsiveness, efficient sharing of resources, ease of programming, etc., are maintained.

关键词： Processor scheduling Yarn Scheduling algorithm Switches parallel programming Concurrent computing Aggregates NASA Delay Degradation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：