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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是551-560 订阅

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

详细简洁

排序：

Processor-embedded distributed MEMS-based storage systems for high-performance I/O

Processor-embedded distributed MEMS-based storage systems fo...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： S.C. Chiu Wei-keng Liao A.N. Choudhary Department of Electrical and Computer Engineering Northwestern University Evanston IL USA

Summary form only given. Built upon new data organization and access characteristics, MEMS-based storage devices have come under consideration as an alternative to disks for large data-intensive applications. While not already in commercial production, MEMS-based storage devices have outperformed disks in device-level simulations. Processor-embedded distributed disks improved performance of workloads by offloading application-level processing to the storage. To exploit the potential benefits offered by these emerging storage technologies and offloading models, we propose a processor-embedded distributed MEMS-based storage architecture, and evaluate the proposed architecture with representative database and data mining workloads. Our results show that MEMS-based storage improved the overall performance of these workloads over disk-based systems, and transformed the characteristics of several workloads, impacting the design points for future storage architectures.

关键词： Power system interconnection Power system reliability Delay Application software Production Microelectromechanical devices Databases Data mining Bandwidth parallel processing

来源：评论

学校读者我要写书评

暂无评论

A model of scalable distributed network performance management

A model of scalable distributed network performance manageme...

引用

international symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： Zeng Bin Hu Tao Wang Wei Li Zi Tan University of Naval Engineering Wuhan China

ISBN: (纸本)0769521355

Quality of service in IP networks necessitates the use of performance management. As Internet continues to grow exponentially, a management system should be scalable in terms of network size, speed and number of customers subscribed to value-added services. This article proposes a flexible, scalable, self-adapting model for managing large-scale distributed network. In this model, Web services framework is used to build the software architecture and XML is used to build the data exchange interface. Policy-based hierarchical event-processing mechanism presented by this paper can efficiently balance the loads and improve the flexibility of the system. The prediction algorithm adopted by this model can predict the network performance more effectively and accurately.

关键词： IP networks Quality of service Quality management Web and internet services Large-scale systems Web services software architecture XML Prediction algorithms Predictive models

来源：评论

学校读者我要写书评

暂无评论

A novel method for adding multiprocessor support to a large and complex uniprocessor kernel

A novel method for adding multiprocessor support to a large ...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： S. Kagstrom L. Lundberg H. Grahn School of Engineering Blekinge Institute of Technology Ronneby Sweden

Summary form only given. The current trend of using multiprocessor computers for server applications requires operating system adoptions for high performance. However, modifying large bodies of software is very costly and time-consuming, and the cost of porting an operating system to a multiprocessor might not be motivated by the potential performance benefits. We present a novel method, the application kernel approach, for adaption of an existing uniprocessor kernel to SMP hardware. Our approach considers the existing kernel as a "black box", to which no or small changes are made. Instead, the original kernel runs OS-services unmodified on one processor whereas the other processors execute applications on top of a small custom kernel. A prototype implementation illustrates that the approach can be realized with fairly small resources. We also present an initial performance evaluation where we show that the performance is good for user-bound applications.

关键词： Kernel Operating systems Application software Hardware Prototypes Costs Computer applications High performance computing software performance Manufacturing processes

来源：评论

学校读者我要写书评

暂无评论

Adaptive memory paging for efficient gang scheduling of parallel applications

Adaptive memory paging for efficient gang scheduling of para...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： K.D. Ryu N. Pachapurkar L.L. Fong Department of Computer Science & Engineering Arizona State University Tempe AZ USA IBM Thomas J. Watson Research Center Yorktown Heights NY USA

Summary form only given. The gang scheduling paradigm allows timesharing of computing nodes by multiple parallel applications and supports the coordinated context switches of these applications. It can improve system responsiveness and resource utilization. However, the memory paging overhead incurred during context switches can be expensive and may diminish the positive effects of gang scheduling. We investigate the reduction of paging overhead in gang scheduling environments by applying a set of simple, yet effective, adaptive paging techniques: selective page-out, aggressive page-out, adaptive page-in and background writing. Our experiments with NAS NPB2 benchmark programs show that these new adaptive paging mechanisms can reduce the job switching time significantly (up to 90%).

关键词： Processor scheduling Switches Concurrent computing Delay Application software Resource management Writing Adaptive systems Operating systems parallel processing

来源：评论

学校读者我要写书评

暂无评论

Dynamic adjustment of execution order in real-time databases

Dynamic adjustment of execution order in real-time databases

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Yongyan Wang Qiang Wang Hongan Wang Guozhong Dai Intelligence Engineering Laboratory Institute of Software Chinese Academy and Sciences Beijing China

ISBN: (纸本)0769521320

Summary form only given. Many researches have been devoted to designing appropriate concurrency control algorithms for real-time database systems, which not only satisfy consistency requirements but also meet transaction timing constraints as much as possible. Optimistic concurrency control protocols have the nice properties of being nonblocking and deadlock-free, but they have the problems of late conflict detection and transaction restarts. Although the number of transaction restarts is reduced by dynamic adjustment of serialization order (DASO) in real-time database systems, it still has some unnecessary transaction restarts. We first propose a new method called dynamic adjustment of execution order (DAEO) and a new optimistic concurrency control algorithm based on DAEO, which can reduce the number of unnecessary restarts near to zero and outperforms the previous algorithms, and then discuss the experiments and the results.

关键词： Concurrency control Protocols Database systems Real time systems Optimization methods Algorithm design and analysis Timing System recovery Delay Transaction databases

来源：评论

学校读者我要写书评

暂无评论

Hybrid checkpoint protocol for cell-dependent infrastructured networks

Hybrid checkpoint protocol for cell-dependent infrastructure...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： M. Ono H. Higaki Department of Computers and System Engineering Tokyo Denki University Hiki Saitama Japan

Summary form only given. For supporting mission-critical applications in a mobile network system, hybrid checkpointing has been proposed. In a recent mobile network, wireless LAN protocols such as IEEE 802.11 and HIPERLAN are getting popular and communication with mobile computers is realized by using Mobile IP in the Internet. We propose a novel hybrid checkpoint protocol. Here, message logging for mobile computers is achieved based on broadcast property of wireless LAN protocols. In addition, by extending Mobile IP, network overload in recovery is avoided. For both checkpointing and recovery in the proposed protocol, all required information is piggied back to messages. That is, no additional message is required.

关键词： Mobile computing Checkpointing Wireless LAN Wireless application protocol Mission critical systems Application software Mobile communication Computer networks IP networks Broadcasting

来源：评论

学校读者我要写书评

暂无评论

Implementing a reconfigurable atomic memory service for dynamic networks

Implementing a reconfigurable atomic memory service for dyna...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： P.M. Musial A.A. Shvartsman Department of Computer Science and Engineering University of Connecticut Storrs CT USA Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge MA USA

Summary form only given. Transforming abstract algorithm specifications into executable code is an error-prone process in the absence of sophisticated compilers that can automatically translate such specifications into the target distributed system. We present a framework that was developed for translating algorithms specified as Input/Output Automata (IOA) to distributed programs. The framework consists of a methodology that guides the software development process and a core set of functions needed in target implementations that reduce unnecessary software development. The systems developed using this methodology preserve the modularity of the original specifications, making it easier to track refinements and effect optimizations. As a proof of concept, this work also presents a distributed implementation of a reconfigurable atomic memory service for dynamic networks (RAMBO). This service emulates atomic read/write shared objects in the dynamic setting where processors can arbitrarily crash, or join and leave the computation. The algorithm tolerates processor crashes and message loss and guarantees atomicity for arbitrary patterns of asynchrony and failure. The algorithm implementing the service is given in terms of IOA. An important consideration in formulating RAMBO was that it could be employed as a building block in real systems. Following a formal presentation of RAMBO algorithm, this work describes an optimized implementation that was developed using the methodology presented here. The system is implemented in Java and runs on a network of workstations. Empirical data illustrates the behavior of the system.

关键词： Computer science Automata Programming Middleware Random access memory Artificial intelligence Laboratories Computer errors Computer crashes Java

来源：评论

学校读者我要写书评

暂无评论

Characterizing and evaluating desktop grids: an empirical study

Characterizing and evaluating desktop grids: an empirical st...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： D. Kondo M. Taufer C.L. Brooks H. Casanova A.A. Chien Computer Science and Engineering Department University of California San Diego La Jolla CA USA Molecular Biology Department Scripps Research Institute La Jolla CA USA San Diego Supercomputer Center La Jolla CA USA

Summary form only given. Desktop resources are attractive for running compute-intensive distributed applications. Several systems that aggregate these resources in desktop grids have been developed. While these systems have been successfully used for many high throughput applications there has been little insight into the detailed temporal structure of CPU availability of desktop grid resources. Yet, this structure is critical to characterize the utility of desktop grid platforms for both task parallel and even data parallel applications. We address the following questions: (i) What are the temporal characteristics of desktop CPU availability in an enterprise setting? (ii) How do these characteristics affect the utility of desktop grids? (iii) Based on these characteristics, can we construct a model of server "equivalents" for the desktop grids, which can be used to predict application performance? We present measurements of an enterprise desktop grid with over 220 hosts running the Entropia commercial desktop grid software. We utilize these measurements to characterize CPU availability and develop a performance model for desktop grid applications for various task granularities, showing that there is an optimal task size. We then use a cluster equivalence metric to quantify the utility of the desktop grid relative to that of a dedicated cluster.

关键词： Availability Aggregates Throughput Application software Computer science Supercomputers Biology computing Computer applications distributed computing Predictive models

来源：评论

学校读者我要写书评

暂无评论

An executable model for a family of election algorithms

An executable model for a family of election algorithms

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： W. Shi J.-P. Corriveau School of Computer Science Carleton University Ottawa Canada

Summary form only given. We present an executable model for a family of algorithms dealing with leader election in a ring topology. We follow the traditional approach of system family engineering. That is, we develop a feature model that captures variability across these algorithms. We then proceed to produce a generator. This generator receives as inputs specific values for each of the variation points (i.e., features) we identify. And it produces the behavior corresponding to the specific configuration of features at hand. Contrary to existing generative programming literature, we do not resort to C++ meta-programming but instead develop an executable model using Rational Rose RT. More precisely, we have designed a single state chart that can model all the algorithms of the family we studied. We focus here on how to obtain such a state chart, rather than on the identification of the features we used, or on ROSE-RT semantics. We do believe however that our approach can be reused to provide a semantically unified and executable modelling approach for other families of algorithms.

关键词： Nominations and elections Topology systems engineering and theory Algorithm design and analysis Testing Computer science Drives Design optimization Costs software engineering

来源：评论

学校读者我要写书评

暂无评论

Cycloid: a constant-degree and lookup-efficient P2P overlay network

Cycloid: a constant-degree and lookup-efficient P2P overlay ...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： H. Shen C.-Z. Xu Guihai Chen Department of Electrical & Computer Engineering Wayne State University Detroit MI USA State Key Laboratory of Novel Software Technology Nanjing University Nanjing China

Summary form only given. There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(logn) hops per lookup request with O(logn) neighbors per node, where n is the network size. We present a constant-degree P2P architecture, namely Cycloid, which emulates a cube-connected-cycles (CCC) graph in the routing of lookup requests. It achieves a time complexity of O(d) per lookup request by using O(1) neighbors per node, where n = d/spl middot/ 2/sup d/. We compare Cycloid with other two constant-degree systems, Viceroy and Koorde in various architectural aspects via simulation. Simulation results show that Cycloid has more advantages for large scale and dynamic systems that have frequent node arrivals and departures. In particular, Cycloid delivers a higher location efficiency in the average case and exhibits a more balanced distribution of keys and query loads between the nodes.

关键词： Peer to peer computing Routing Large-scale systems Resource management Costs Robustness

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共95页 << < 52 53 54 55 56 57 58 59 60 61 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：