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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

54 篇 会议
2 篇 期刊文献

馆藏范围

56 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

52 篇 工学
- 52 篇 计算机科学与技术...
- 50 篇 软件工程
- 7 篇 信息与通信工程
- 3 篇 控制科学与工程
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
18 篇 理学
- 17 篇 数学
- 1 篇 物理学
- 1 篇 统计学（可授理学、...
8 篇 管理学
- 5 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 2 篇 工商管理

主题

38 篇 java programming...
7 篇 java
2 篇 tuple
1 篇 dsm
1 篇 runtime
1 篇 compilers
1 篇 bytecode
1 篇 multi-dimensiona...
1 篇 message passing
1 篇 game animals
1 篇 fixed-point arit...
1 篇 real-time java
1 篇 jni
1 篇 signal processin...
1 篇 integration
1 篇 compiler
1 篇 performance metr...
1 篇 optimization
1 篇 object inlining
1 篇 lightweight data...

机构

2 篇 delft univ techn...
1 篇 department of co...
1 篇 los alamos natl ...
1 篇 computer science...
1 篇 inst. for advanc...
1 篇 dep. arquitectur...
1 篇 department of co...
1 篇 dept. of comp./i...
1 篇 mpi software tec...
1 篇 indiana univ blo...
1 篇 faculty of scien...
1 篇 mpi software tec...
1 篇 politecnico di t...
1 篇 university of il...
1 篇 faculty of scien...
1 篇 electrotechnical...
1 篇 dept. of math an...
1 篇 commissariat a l...
1 篇 department of co...
1 篇 theoretical divi...

作者

3 篇 bal henri e.
2 篇 bull j.m.
2 篇 caromel denis
2 篇 vanderheyden w.b...
2 篇 sips hj
2 篇 maassen jason
2 篇 smith l.a.
2 篇 van reeuwijk c
1 篇 kielmann thilo
1 篇 fahringer thomas
1 篇 baude françoise
1 篇 n. younan
1 篇 swanson david
1 篇 cierniak michal
1 篇 manson jeremy
1 篇 schuster assaf
1 篇 mckinley kathryn...
1 篇 shagin konstanti...
1 篇 worrall basil
1 篇 dai yafei

语言

56 篇 英文

检索条件"任意字段=Proceedings of the ACM 2001 Java Grande/ISCOPE Conference"

共 56 条记录，以下是31-40 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Benchmarking java against C/C++ for interactive scientific visualization

Benchmarking Java against C/C++ for interactive scientific v...

引用

proceedings of the Joint acm java grande - iscope 2002 conference

作者： Sangappa, Sudhir Palaniappan, K. Tollerton, Richard AVS Express Technical Team Advanced Visual Systems Inc Waltham MA 02451 United States Dept. Comp. Eng. and Comp. Science University of Missouri - Columbia Columbia MO 65211 United States

Interactive scientific visualization applications require both high performance graphics and numerical computation capabilities. C/C++ programs are able to take direct advantage of specialized graphics rendering hardware (referred to as a Graphics Processing Unit or GPU) for display and special SIMD instructions within the CPU for computation. The former using for example the OpenGL library and latter using compiler extensions. Software developed in java offers portability, robustness and security. However, the graphics rendering performance, memory efficiency, and computational speed of java for visualization of large scientific data sets has not been well characterized. Benchmarking experiments were done using the JLoop (java) and Loop (C/C++) visualization software for animation of 2D datasets. Preliminary results for six different hardware platforms showed that compared to the C/C++ version, the java implementation was four to five times slower for graphics image animation, used on average 2.5 to three times more memory, and was up to 3.6 times slower using a pure numerical benchmark that simulated image pixel operations. Such benchmarks should be used to improve the java VM performance across platforms, similar to JIT-compiler design.

关键词： java programming language

来源：评论

学校读者我要写书评

暂无评论

Efficient, flexible, and typed group communications in java 02

Efficient, flexible, and typed group communications in Java

引用

proceedings of the Joint acm java grande - iscope 2002 conference

作者： Baduel, Laurent Baude, Françoise Caromel, Denis INRIA Sophia Antipolis CNRS - 13S Univ. Nice Sophia Antipolis 2004 Route des Lucioles BP 93 F-06902 Sophia-Antipolis Cedex France

ISBN: (纸本)9781581135992

Group communication is a crucial feature for high-performance and Grid computing. While previous works and libraries proposed such a characteristic (e.g. MPI, or object-oriented frameworks), the use of groups imposed specific constraints on programmers - for instance the use of dedicated interfaces to trigger group communications. We aim at a more flexible mechanism. More specifically, this paper proposes a scheme where, given a java class, one can initiate group communications using the standard public methods of the class together with the classical dot notation;in that way, group communications remain typed. Furthermore, groups are automatically constructed to handle the result of collective operations, providing an elegant and effective way to program gather operations. This flexibility also allows to handle results that are groups of remotely accessible objects, and to use a group as a means to dispatch different parameters to different group members (for instance in a cyclic manner). Furthermore, hierarchical groups can be easily and dynamically constructed;an important feature to achieve the use of several clusters in Grid computing. Performance measures demonstrate the viability of the approach. The challenge is to provide easy to use, efficient, and dynamic group management for objects dynamically distributed on the Grid.

关键词： java programming language

来源：评论

学校读者我要写书评

暂无评论

Ibis: An efficient java-based grid programming environment 02

Ibis: An efficient Java-based grid programming environment

引用

proceedings of the Joint acm java grande - iscope 2002 conference

作者： Van Nieuwpoort, Rob V. Maassen, Jason Hofman, Rutger Kielman, Thilo Bal, Henri E. Faculty of Sciences Div. of Math. and Computer Science Vrije Universiteit De Boelelaan 1081a 1081 HV Amsterdam Netherlands

ISBN: (纸本)9781581135992

In computational grids, performance-hungry applications need to simultaneously tap the computational power of multiple, dynamically available sites. The crux of designing grid programming environments stems exactly from the dynamic availability of compute cycles: grid programming environments (a) need to be portable to run on as many sites as possible, (b) they need to be flexible to cope with different network protocols and dynamically changing groups of compute nodes, while (c) they need to provide efficient (local) communication that enables high-performance computing in the first place. Existing programming environments are either portable (java), or they are flexible (Jini, java RMI), or they are highly efficient (MPI). No system combines all three properties that are necessary for grid computing. In this paper, we present Ibis, a new programming environment that combines java's "run everywhere" portability both with flexible treatment of dynamically available networks and processor pools, and with highly efficient, object-based communication. Ibis can transfer java objects very efficient by combining streaming object serialization with a zero-copy protocol. Using RMI as a simple test case, we show that Ibis outperforms existing RMI implementations, achieving up to 9 times higher throughputs with trees of objects.

关键词： java programming language

来源：评论

学校读者我要写书评

暂无评论

Simple and effective array prefetching in java 02

Simple and effective array prefetching in Java

引用

proceedings of the Joint acm java grande - iscope 2002 conference

作者： Cahoon, Brendon McKinley, Kathryn S. Department of Computer Science University of Massachusetts Amherst MA 0100 United States Department of Computer Sciences University of Texas at Austin Austin TX 78712 United States

ISBN: (纸本)9781581135992

java is becoming a viable choice for numerical algorithms due to the software engineering benefits of object-oriented programming. Because these programs still use large arrays that do not fit in the cache, they continue to suffer from poor memory performance. To hide memory latency, we describe a new unified compile-time analysis for software prefetching arrays and linked structures in java. Our previous work uses data-flow analysis to discover linked data structure accesses, and here we present a more general version that also identifies loop induction variables used in array accesses. Our algorithm schedules prefetches for all array references that contain induction variables. We evaluate our technique using a simulator of an out-of-order superscalar processor running a set of array-based java programs. Across all our programs, prefetching reduces execution time by a geometric mean of 23%, and the largest improvement is 58%. We also evaluate prefetching on a PowerPC processor, and we show that prefetching reduces execution time by a geometric mean of 17%. Traditional software prefetching algorithms for C and Fortran use locality analysis and sophisticated loop transformations. Because our analysis is much simpler and quicker, it is suitable for including in a just-in-time compiler. We further show that the additional loop transformations and careful scheduling of prefetches used in previous work are not always necessary for modern architectures and java programs.

关键词： java programming language

来源：评论

学校读者我要写书评

暂无评论

Elimination of java array bounds checks in the presence of indirection 02

Elimination of Java array bounds checks in the presence of i...

引用

proceedings of the Joint acm java grande - iscope 2002 conference

作者： Luján, Mikel Gurd, John R. Freeman, T.L. Miguel, José Centre for Novel Computing University of Manchester Oxford Road Manchester M13 9PL United Kingdom Dep. Arquitectura Tecnologia Comp. UPV-EHU P.O. Box 649 20080 Donostia-San Sebastian Spain

ISBN: (纸本)9781581135992

The java language specification states that every access to an array needs to be within the bounds of that array;i.e. between 0 and array length -1. Different techniques for different programming languages have been proposed to eliminate explicit bounds checks. Some of these techniques are implemented in off-the-shelf java Virtual Machines (JVMs). The underlying principle of these techniques is that bounds checks can be removed when a JVM/compiler has enough information to guarantee that a sequence of accesses (e.g. inside a for-loop) is safe (within the bounds). Most of the techniques for the elimination of array bounds checks have been developed for programming languages that do not support multi-threading and/or enable dynamic class loading. These two characteristics make most of these techniques unsuitable for java. Techniques developed specifically for java have not addressed the elimination of array bounds checks in the presence of indirection, that is, when the index is stored in another array (indirection array). With the objective of optimising applications with array indirection, this paper proposes and evaluates three implementation strategies, each implemented as a java class. The classes provide the functionality of java arrays of type int so that objects of the classes can be used instead of indirection arrays. Each strategy enables JVMs, when examining only one of these classes at a time, to obtain enough information to remove array bounds checks.

关键词： java programming language

来源：评论

学校读者我要写书评

暂无评论

javaSymphony: New directives to control and synchronize locality, parallelism, and load balancing for cluster and grid-computing 02

JavaSymphony: New directives to control and synchronize loca...

引用

proceedings of the Joint acm java grande - iscope 2002 conference

作者： Fahringer, Thomas Jugravu, Alexandru Institute for Software Science University of Vienna Liechtensteinstr. 22 A-1090 Vienna Austria

ISBN: (纸本)9781581135992

There has been an increasing research interest in extending the use of java towards performance-oriented programming for distributed and concurrent applications. Numerous research projects have introduced class libraries or language extensions for java in order to support automatic management of locality, parallelism and load balancing which is almost entirely under the control of a runtime system and frequently results in critical performance problems. In previous work we described javaSymphony to substantially alleviate this problem. javaSymphony is a java class library that allows the programmer to control parallelism, load balancing, and locality at a high level. Objects can be explicitly distributed and migrated based on a high-level API to static/dynamic system parameters and dynamic virtual distributed architectures which impose a virtual hierarchy on a distributed system of physical computing nodes. In this paper we describe various important extensions to the original javaSymphony API which includes a generalization of virtual architectures that can be used to specify and to request arbitrary heterogeneous distributed and concurrent architectures. The number of threads that execute an object's methods can be controlled dynamically through single- and multi-threaded objects. Conventional java objects can be dynamically converted to javaSymphony objects. A (un)lock mechanism has been introduced in order to avoid inconsistent modification of objects or virtual architectures. A sophisticated event mechanism for asynchronous communication, coordination, and interaction is provided. Several synchronization constructs including barrier synchronization and synchronization for asynchronous method invocations have been included. Experiments are presented to demonstrate the effectiveness and efficiency of javaSymphony.

关键词： java programming language

来源：评论

学校读者我要写书评

暂无评论

acm 2001 java grande/iscope conference: Foreword

ACM 2001 Java Grande/ISCOPE Conference: Foreword

引用

proceedings of the acm 2001 java grande/iscope conference

作者： Caromel, Denis Reynders, John Philippsen, Michael

来源：评论

学校读者我要写书评

暂无评论

Object combining: A new aggressive optimization for object intensive programs 02

Object combining: A new aggressive optimization for object i...

引用

proceedings of the Joint acm java grande - iscope 2002 conference

作者： Veldema, Ronald Jacobs, Ceriel J.H. Hofman, Rutger F.H. Bal, Henri E. Dept. of Math. and Computer Science Vrije Universiteit Amsterdam Netherlands

ISBN: (纸本)9781581135992

Object combining tries to put objects together that have roughly the same life times in order to reduce strain on the memory manager and to reduce the number of pointer indirections during a program's execution. Object combining works by appending the fields of one object to another, allowing allocation and freeing of multiple objects with a single heap (de)allocation. Unlike object in-lining, which will only optimize objects where one has a (unique) pointer to another, our optimization also works if there is no such relation. Object inlining also directly replaces the pointer by the inlined object's fields. Object combining leaves the pointer in place to allow more combining. Elimination of the pointer accesses is implemented in a separate compiler optimization pass. Unlike previous object inlining systems, reference field overwrites are allowed and handled, resulting in much more aggressive optimization. Our object combining heuristics also allow unrelated objects to be combined, for example those allocated inside a loop;recursive data structures (linked lists, trees) can be allocated several at a time and objects that are always used together can be combined. The main focus of object combining in this paper is on reducing object (de)allocation overhead, by reducing both garbage collection work and the number of object allocations. Reduction of memory management overhead causes execution time to be reduced by up to 35%. Indirection removal further reduces execution time by up to 6%.

关键词： java programming language

来源：评论

学校读者我要写书评

暂无评论

inAspect™: interfacing java and VSIPL 02

inAspect™: interfacing Java and VSIPL

引用

proceedings of the 2002 joint acm-iscope conference on java grande

作者： V. Shah A. Skjellum N. Younan T. Alford D. Whitcomb A. Watkins Mississippi State University MS MPI Software Technology Inc. Starkville MS

ISBN: (纸本)9781581135992

In this paper, we discuss the origin, design, performance, and directions of the inAspect high-performance signal and image processing package for java. The Vector Signal and Image Processing (VSIPL) community provides a standardized API (Application Programmer Interface) for high-performance signal and image processing plus linear algebra with a C emphasis and object-based design framework. java programmers need high performance and/or portable APIs for this broad base of functionality as well. InAspect addresses PDA's, embedded java boards, workstations, and servers, with emphasis on embedded systems at present. Efforts include supporting integer precisions and utilizing CORDIC algorithms, both aimed at added relevance for limited-performance environments, such as present-day PDAs.

关键词： signal processing fixed-point arithmetic high-performance multi-platform linear algebra embedded java JNI VSIPL image processing

来源：评论

学校读者我要写书评

暂无评论

Arlequin: An integrated java application 01

Arlequin: An integrated Java application

引用

proceedings of the acm 2001 java grande/iscope conference

作者： Stankovski, Zarko Commissariat a l'Energie Atomique DM2S/SERMA CEA Saclay 91 191 Gif sur Yvette France

ISBN: (纸本)1581133596

Arlequin, an integrated java application which demonstrated the possibility to build a complete application in java, was presented. Arlequin is an assembly of java packages Peyo, Silene and Margarita. The analysis showed that the Margarita used the JNL array package and performed openMP-like parallel calculations with the JOMP package.

关键词： java programming language

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共6页 << < 1 2 3 4 5 6 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：