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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

900 篇 会议
22 册 图书
22 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

356 篇 工学
- 335 篇 计算机科学与技术...
- 255 篇 软件工程
- 50 篇 信息与通信工程
- 34 篇 电气工程
- 32 篇 控制科学与工程
- 23 篇 电子科学与技术（可...
- 14 篇 网络空间安全
- 10 篇 动力工程及工程热...
- 7 篇 机械工程
- 5 篇 交通运输工程
- 5 篇 生物工程
- 5 篇 安全科学与工程
- 4 篇 力学（可授工学、理...
- 4 篇 材料科学与工程（可...
- 4 篇 化学工程与技术
- 4 篇 环境科学与工程（可...
- 4 篇 生物医学工程（可授...
- 3 篇 建筑学
93 篇 理学
- 65 篇 数学
- 19 篇 系统科学
- 8 篇 统计学（可授理学、...
- 7 篇 物理学
- 7 篇 生物学
- 4 篇 化学
87 篇 管理学
- 71 篇 管理科学与工程(可...
- 31 篇 工商管理
- 17 篇 图书情报与档案管...
5 篇 法学
- 5 篇 社会学
4 篇 教育学
- 4 篇 教育学
3 篇 经济学
- 3 篇 应用经济学
3 篇 医学

主题

267 篇 application soft...
123 篇 computer science
114 篇 hardware
102 篇 concurrent compu...
99 篇 distributed comp...
84 篇 computer archite...
77 篇 parallel process...
59 篇 computer network...
58 篇 computational mo...
56 篇 processor schedu...
54 篇 delay
53 篇 software enginee...
51 篇 resource managem...
51 篇 large-scale syst...
50 篇 costs
48 篇 runtime
48 篇 real time system...
42 篇 software systems
41 篇 operating system...
40 篇 parallel program...

机构

8 篇 ibm thomas j. wa...
5 篇 school of electr...
5 篇 school of comput...
5 篇 department of co...
5 篇 department of co...
4 篇 software school ...
4 篇 department of co...
4 篇 department of el...
4 篇 institute of com...
4 篇 department of co...
3 篇 department of en...
3 篇 department of el...
3 篇 cncert/cc
3 篇 research centre ...
3 篇 department of el...
3 篇 school of electr...
3 篇 department of el...
3 篇 department of el...
3 篇 school of softwa...
3 篇 institute for pa...

作者

7 篇 l.r. welch
6 篇 m. parashar
6 篇 gao guang r.
5 篇 h. casanova
5 篇 jack dongarra
5 篇 zimeo eugenio
5 篇 hong jiang
5 篇 s. hariri
5 篇 wei-keng liao
4 篇 j.-l. gaudiot
4 篇 suzhen wu
4 篇 b. pfarr
4 篇 m. kandemir
4 篇 g.r. gao
4 篇 alok choudhary
4 篇 l. welch
4 篇 p. sobe
4 篇 bo mao
4 篇 wentong cai
4 篇 minyi guo

语言

935 篇 英文
8 篇 其他
1 篇 中文

检索条件"任意字段=PDSE 2000: International Symposium on Software Engineering for Parallel and Distributed Systems"

共 944 条记录，以下是661-670 订阅

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

详细简洁

排序：

Capturing causality by compressed vector clock in real-time group editors

Capturing causality by compressed vector clock in real-time ...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Chengzheng Sun Wentong Cai School of Computing and Information Tech Griffith University Brisbane QLD Australia School of Computer Engineering Nanyang Technological University Singapore

ISBN: (纸本)0769515738

Real-time group editors allow a group of users to view and edit the same document at the same time over the Internet. They are a special class of distributed applications in the area of groupware. A vector logical clock is a powerful technique to capture causality in distributed computing systems. In general, the minimum size of a vector clock is the number of communicating processes in a distributed system (N). In this paper, we propose a novel technique to compress the vector size from N to a constant (2) by means of operational transformation - an innovative technique invented by groupware research for consistency maintenance in real-time group editors. We show how compressed vector clocks can be used as an effective and efficient means for operation time-stamping and concurrency detection in group editors. The proposed technique has been implemented in a Web-based real-time group editor which allows an arbitrary number of users to participate a collaborative editing session. The basic ideas and techniques of this work may be generalized and are potentially applicable to other distributed computing systems and applications.

关键词： Clocks distributed computing Collaborative work Vectors Collaborative software Sun Home computing Australia Internet Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Models and scheduling mechanisms for global computing applications

Models and scheduling mechanisms for global computing applic...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： D. Kondo H. Casanova E. Wing F. Berman Computer Science and Engineering Department University of California La Jolla CA USA San Diego Supercomputer Center CA USA

Projects like SETI@home have demonstrated the tremendous capabilities of Internet-connected commodity resources. The rapid improvement of commodity components makes the global computing platform increasingly viable for other large-scale data and compute-intensive applications. In this paper, we study how global computing can accommodate new types of applications. We describe a global computing model that captures resource characteristics and instantiate this model with data from several surveys and studies. We propose performance metrics for global computing applications and evaluate two scheduling mechanisms in simulation. We then draw conclusions concerning the development and enhancement of global computing systems.

关键词： Processor scheduling Computer applications Peer to peer computing Throughput Application software Internet Computational modeling Supercomputers Concurrent computing Genomics

来源：评论

学校读者我要写书评

暂无评论

parallel Computing Applications and Financial Modelling

Parallel Computing Applications and Financial Modelling

引用

2002 international symposium on distributed Computing and Applications for Business engineering and Science

作者： Heather M.Liddell D.Parkinson G.S.Hodgson P.Dzwig Department of Computer Science Queen MaryUniversity of LondonMile End RoadLondon E1 4NSU.K

My colleagues and I at Queen Mary, University of London, have over twenty years of experience in parallel Computing Applications, mostly on "massively parallel systems", such as the distributed Array Processors (DAPs). The applications in which we were involved included design of numerical subroutine libraries, Finite Element software, graphics tools, the physics of organic materials, medical imaging, computer vision and more recently, Financial modelling. Two of the projects related to the latter are described in this paper, namely Portfolio Optimisation and Financial Risk Assessment.

关键词： parallel computing, massively parallel systems, distributed Array Processor, Financial modelling, Portfolio Optimisation, Risk Assessment.

来源：评论

学校读者我要写书评

暂无评论

On Advantages of Grid Computing for parallel Job Scheduling 02

On Advantages of Grid Computing for Parallel Job Scheduling

引用

IEEE/ACM international symposium on Cluster Computing and the Grid (CCGRID)

作者： C. Ernemann V. Hamscher U. Schwiegelshohn R. Yahyapour A. Streit Computer Engineering Institute University of Dortmund Dortmund Germany PC2-Paderborn Center for Parallel Computing Paderborn Germany

ISBN: (纸本)9780769515823

This paper addresses the potential benefit of sharing jobs between independent sites in a grid computing environment. Also the aspect of parallel multi-site job execution on different sites is discussed. To this end, various scheduling algorithms have been simulated for several machine configurations with different workloads which have been derived from real traces. The results showed that a significant improvement in terms of a smaller average response time is achievable. The usage of multi-site applications can additionally improve the results as long as the increase of the execution time due to communication overhead is limited to about 25%.

关键词： Grid computing Processor scheduling Delay distributed computing Concurrent computing Electronic switching systems Computational modeling Application software Metacomputing parallel processing

来源：评论

学校读者我要写书评

暂无评论

Load balancing highly irregular computations with the adaptive factoring

Load balancing highly irregular computations with the adapti...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： I. Banicescu V. Velusamy Department of Computer Science Engineering Research Center for Computational Systems Mississippi State University USA

In heterogeneous environments, employing dynamic scheduling algorithms to improve performance of scientific applications via load balancing is essential. Presently, these algorithms require prior knowledge about workload via profiling resulting in higher overhead as problem sizes and number of processors increase. In addition, variations in work load at runtime may be unpredictable, making profiling work tedious and sometimes even obsolete. Therefore, dynamic loop scheduling schemes such as Factoring, Fractiling, andWeighted Factoring have been proposed and proved to be extremely instrumental when used in scientific applications such as Monte-Carlo simulations, N-Body simulations, radar applications, and others. Adaptive Factoring, a technique that evolves from these schemes and addresses a wider range of irregularities has recently been proposed. This paper reports on performance improvements obtained by integrating the Adaptive Factoring, into a scientific application that invloves computational field simulation on unstructured grids. Performance of this scientific application using the implementation with Adaptive Factoring is compared with implementations using other dynamic loop scheduling techniques. Reported experimental results confirm the benefits of using the Adaptive Factoring and its high potential for a successful integration in other scientific applications, especially the ones characterized by highly irregular behaviour whose performance degradation is primarily due to load imbalance.

关键词： Load management Computational modeling Delay Dynamic scheduling Heuristic algorithms Application software Runtime Processor scheduling Computational fluid dynamics Computer science

来源：评论

学校读者我要写书评

暂无评论

parallel Algorithm for ODE Modeling Problems

Parallel Algorithm for ODE Modeling Problems

引用

2002 international symposium on distributed Computing and Applications for Business engineering and Science

作者： Lishan Kang, Yan Li , Yuping Chen, Hongqing Cao Department of Computer Sciences, China University of Geosciences State Key Laboratory of software engineering, Wuhan University Wuhan 430072, P. R. China

How to discover high-level knowledge such as laws of natural science in observed data automatically is a very important and difficult task in scientific research. In this paper, high-level knowledge modeled by systems of ordinary differential equations (ODEs) is discovered in observed dynamic data automatically by an asynchronous parallel evolutionary algorithm. A numerical example is used to demonstrate the potential of the parallel algorithm. The results show that the dynamic models discovered automatically in observed dynamic data by computer sometimes is comparable with the mode discovered by human.

关键词： parallel algorithm, knowledge discovery, Evolutionary modeling

来源：评论

学校读者我要写书评

暂无评论

Priority based messaging for software distributed shared memory 15

Priority based messaging for software distributed shared mem...

引用

15th international parallel and distributed Processing symposium, IPDPS 2001

作者： Karlsson, S. Brorsson, M. Department of Microelectronics and Information Technology Royal Institute of Technology Stockholm Sweden

ISBN: (纸本)0769509908

software distributed Shared Memory (DSM) systems can be used to provide a coherent shared address space on multicomputers and other parallel systems without support for shared memory in hardware. The coherency software automatically translates shared memory accesses to explicit messages exchanged among the nodes in the system. Many applications exhibit a good performance on such systems but it has been shown that performance critical messages can be delayed behind less important messages because of the enqueuing behavior in the communication libraries used in current systems. We present in this paper a new portable communication library that supports priorities to remedy this situation. We describe an implementation of the communication library and a quantitative model that is used to estimate the performance impact of priorities for a typical situation. Using the model, we show that the use of high-priority communication reduces the latency of performance critical messages substantially over a wide range of network design parameters. The latency is reduced with up to 10-25% for each delaying low priority message in the queue ahead. © 2001 IEEE.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Mobile computing: Operational models, programming modes and software tools 15

Mobile computing: Operational models, programming modes and ...

引用

15th international parallel and distributed Processing symposium, IPDPS 2001

作者： Murthy, V.K. Department of Systems and Engineering Management Chinese University of Hong Kong Shatin N.T. Hong Kong

ISBN: (纸本)0769509908

This paper describes the operational Models, Programming Paradigms and software Tools needed for a successful mobile computing environment. In particular, we consider the role of various interactive distributed computing models (client server-CS, code on demand -COD, remote evaluation- REV, and mobile agents - MA, and three-tier system- TTS), different logical modes of programming (Imperative, declarative, subjunctive and abductive), transaction and workflow models (that relax atomicity, consistency, isolation, duarbility and serializability properties), new protocols and software tools (PJava/JDBC) that are needed. Illustrative examples are drawn from important mobile computing application areas: such as telediagnosis, remote negotiation and cooperative problem solving. Relevant bibliography is provided. © 2001 IEEE.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Efficient categorization of memory sharing patterns in software DSM systems 15

Efficient categorization of memory sharing patterns in softw...

引用

15th international parallel and distributed Processing symposium, IPDPS 2001

作者： De Castro, M.C.S. De Amorim, C.L. Computer Science Department Federal University of Juiz de Fora Minas Gerais Brazil COPPE - Systems Engineering Federal University of Rio de Janeiro Rio de Janeiro Brazil

ISBN: (纸本)0769509908

This work introduces a new technique that enables SDSMs to categorize dynamically and accurately memory sharing patterns in both classes of regular and irregular applications. The categorization is carried out automatically at run-time on a per-page basis, requiring no user or compiler assistance. We evaluate the potential benefits of our technique using execution-driven simulations of 8 applications running on TrendMarks on a network of 8 workstations. Surprisingly, we found that producer-consumer(s) and migratory are the dominant patterns even in irregular applications. Preliminary results suggest that the categorization technique we propose is a promising option to further improve the performance of current adaptive SDSM systems. © 2001 IEEE.

关键词： adaptive software DSM systems latency-hiding techniques memory sharing patterns

来源：评论

学校读者我要写书评

暂无评论

Efficient fine-grain sharing support for software DSMs through segmentation 15

Efficient fine-grain sharing support for software DSMs throu...

引用

15th international parallel and distributed Processing symposium, IPDPS 2001

作者： Roh, Yangwoo Chung, Jaewoong Park, Cheol Ho Park, Daeyeon Department of Electrical Engineering and Computer Science Korea Advanced Institute of Science and Technology 373-1 Kusong-dong Yusong-gu Taejon305-701 Korea Republic of

ISBN: (纸本)0769509908

Providing variable granularities is an attractive way to achieve good speedups for various classes of parallel applications. A few systems achieve this goal by instrumenting an application with the checking code for the state of shared data. Although these systems can provide arbitrary granularities flexibly, they have severe race conditions inherent to software-only approaches as well as the run-time overhead of the instrumentation. In this paper, we propose a new mechanism, which has low overhead and incurs no race conditions while providing variable granularities in software. The unique idea of our mechanism is to delegate the state checks to the segmentation hardware of the Intel X86. The instrumented code only maintains the state of shared data to use the segmentation hardware. Because the hardware atomically performs the required state checks and corresponding references, our mechanism is free from difficult race conditions. This feature efficiently enhances the response time to remote requests via an interrupt mechanism without additional synchronization overheads for avoiding race conditions. The run-time overhead further decreases owing to the reduced works to be done by software. The evaluation results show that our mechanism exhibits sufficiently low overhead even without any optimization. © 2001 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共95页 << < 63 64 65 66 67 68 69 70 71 72 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：