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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

768 篇 会议
27 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

384 篇 工学
- 362 篇 计算机科学与技术...
- 194 篇 软件工程
- 58 篇 信息与通信工程
- 51 篇 电气工程
- 27 篇 电子科学与技术（可...
- 18 篇 控制科学与工程
- 13 篇 材料科学与工程（可...
- 7 篇 安全科学与工程
- 7 篇 网络空间安全
- 4 篇 生物医学工程（可授...
- 3 篇 光学工程
- 3 篇 动力工程及工程热...
- 3 篇 生物工程
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 冶金工程
- 2 篇 土木工程
- 2 篇 交通运输工程
101 篇 理学
- 95 篇 数学
- 18 篇 统计学（可授理学、...
- 8 篇 系统科学
- 5 篇 物理学
- 4 篇 生物学
72 篇 管理学
- 51 篇 管理科学与工程(可...
- 38 篇 工商管理
- 24 篇 图书情报与档案管...
8 篇 经济学
- 8 篇 应用经济学
7 篇 医学
- 7 篇 临床医学
- 2 篇 基础医学(可授医学...
3 篇 法学
- 3 篇 社会学
1 篇 教育学
1 篇 文学
1 篇 农学
1 篇 军事学

主题

121 篇 computer science
94 篇 concurrent compu...
94 篇 distributed comp...
83 篇 distributed data...
79 篇 parallel process...
78 篇 application soft...
76 篇 databases
74 篇 database systems
73 篇 parallel process...
55 篇 delay
53 篇 distributed comp...
52 篇 processor schedu...
45 篇 computer archite...
43 篇 transaction data...
41 篇 algorithm design...
40 篇 costs
39 篇 relational datab...
35 篇 protocols
34 篇 computational mo...
33 篇 hardware

机构

6 篇 ibm thomas j. wa...
5 篇 ieee
4 篇 school of comput...
4 篇 department of co...
4 篇 department of co...
3 篇 center for paral...
3 篇 department of co...
3 篇 lip ens-lyon lyo...
3 篇 department of co...
2 篇 department of co...
2 篇 institute of inf...
2 篇 department of co...
2 篇 institute of inf...
2 篇 computer systems...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of el...
2 篇 department of co...
2 篇 school of comput...

作者

7 篇 a. choudhary
6 篇 a. boukerche
5 篇 j. saltz
4 篇 s.k. das
4 篇 t. kurc
4 篇 a. el abbadi
3 篇 a. rau-chaplin
3 篇 o. wolfson
3 篇 f. dehne
3 篇 p.s. yu
3 篇 a. singh
3 篇 casanova henri
3 篇 c. liu
3 篇 a. bar-noy
3 篇 s. kipnis
3 篇 g. gupta
3 篇 d. agrawal
3 篇 x. shen
2 篇 grove matthew
2 篇 a. burger

语言

792 篇 英文
4 篇 其他

检索条件"任意字段=Proceedings of the first international symposium on Databases in parallel and distributed systems"

共 796 条记录，以下是281-290 订阅

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

详细简洁

排序：

Utilization of a local grid of Mac OS X-based computers using Xgrid 04

Utilization of a local grid of Mac OS X-based computers usin...

引用

international symposium on High Performance distributed Computing

作者： D. Kramer M. Maclnnis Apple Computer Inc. Cupertino CA USA Apple Comput. Inc. Cupertino CA USA

Xgrid Technical Preview 2 is a distributed computing software technology from Apple Computer, Inc. Xgrid leverages the UNIX-based capabilities of Mac OS X to enable the rapid aggregation of Macintosh systems into a simple yet powerful computational grid which can run a wide range of standard and custom solutions with minimal code changes. To demonstrate the technology, the software is run on a networked rack of Xserve G5 servers and a PowerBook G4 laptop. The demonstration shows how Xgrid is utilized to distribute long-running batch and parallel jobs to a local grid of Mac OS X-based computers.

关键词： Operating systems Grid computing distributed computing Application software databases Concurrent computing Protocols Genetics Code standards Robustness

来源：评论

学校读者我要写书评

暂无评论

parallel ray-tracing with a transactional DSM 04

Parallel ray-tracing with a transactional DSM

引用

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

作者： S. Frenz M. Schoettner R. Goeckelmann P. Schulthess Distributed Systems Department Ulm University Germany Distributed Systems Department Ulm University

ISBN: (纸本)9780780384309

distributed shared memory (DSM) is a well-known alternative to explicit message passing and remote procedure call. Numerous DSM systems and consistency models have been proposed in the past. The Plurix project implements a DSM operating system (OS) storing data and code, within the DSM. Our DSM storage features a new consistency model (transactional consistency) combining restartable transactions with an optimistic synchronization scheme instead of relying on a hard to use weak consistency model. In this paper we evaluate our system for the first time with a real parallel application, a parallel ray-tracer. The measurements show that our DSM scales quite well for this application even though we are using a strong consistency model.

关键词： Ray tracing Operating systems Sockets Message passing Application software Protocols Middleware Software packages distributed databases Software tools

来源：评论

学校读者我要写书评

暂无评论

Benchmarking the MRNet distributed tool infrastructure: lessons learned

Benchmarking the MRNet distributed tool infrastructure: less...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： P.C. Roth D.C. Arnold B.P. Miller Computer Sciences Department University of Wisconsin Madison WI USA

Summary form only given. MRNet is an infrastructure that provides scalable multicast and data aggregation functionality for distributed tools. While evaluating MRNet's performance and scalability, we learned several important lessons about benchmarking large-scale, distributed tools and middleware. first, automation is essential for a successful benchmarking effort, and should be leveraged whenever possible during the benchmarking process. Second, micro-benchmarking is invaluable not only for establishing the performance of low-level functionality, but also for design verification and debugging. Third, resource management systems need substantial improvements in their support for running tools and applications together. Finally, the most demanding experiments should be attempted early and often during a benchmarking effort to increase the chances of detecting problems with the tool and experimental methodology.

关键词： Scalability Debugging Large-scale systems Automation Resource management distributed computing Benchmark testing Control systems Middleware Costs

来源：评论

学校读者我要写书评

暂无评论

Hitting times computation for theoretically studying peer-to-peer distributed systems

Hitting times computation for theoretically studying peer-to...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： D. Sohier A. Bui LICA Département de Mathématiques et Informatique Université de Reims Champagne-Ardenne Reims France

Summary form only given. Random walks based algorithms give efficient solutions to many distributed problems. The hitting time, i.e. the average time for the walk starting at a given vertex to first hit another given vertex is one of the main quantity used in the analysis of such algorithms. The growing use of peer-to-peer systems leads to a high bandwidth consumption and random walks are currently investigated as a solution to improve peer-to-peer systems efficiency. Such systems are often modeled by weighted graphs. We show how hitting times can be used in peer-to-peer distributed systems to compare the efficiency of deterministic and random-walks based procedures. An expression of the hitting times on a weighted graph in terms of effective resistances is established. Then, an efficient method to compute all the hitting times on a graph is presented. This method is illustrated by a detailed example.

关键词： Peer to peer computing distributed computing Network topology Bandwidth Broadcasting Search methods Electric resistance Grid computing Random processes distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Role ordering scheduler for concurrency control in distributed objects

Role ordering scheduler for concurrency control in distribut...

引用

international Conference on parallel and distributed systems (ICPADS)

作者： T. Nozaki T. Enokido M. Takizawa Department of Computers and Systems Engineering Tokyo Denki University Japan

Concepts of roles are significant to design and implement access control models in secure information systems. A role shows a job Junction in an enterprise. In addition to keeping systems secure, objects have to be consistent in presence of multiple transactions. Traditional locking protocols and timestamp ordering schedulers are based on principles "first-comer-winner" and "timestamp order" to make multiple transactions serializable, respectively. Each transaction is associated with a role. We define significancy of role where shows how significant each role is in an enterprise. We discuss a novel type of scheduler for concurrency control so that multiple conflicting transactions are serializable in a significant order of roles of transactions.

关键词： Concurrency control Permission Access control Information systems Processor scheduling Design engineering systems engineering and theory Access protocols Relational databases System recovery

来源：评论

学校读者我要写书评

暂无评论

A grid service for interactive dataset analysis

A grid service for interactive dataset analysis

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： D.A. Alexander B. Miller T. Johnson M. Turri V. Serbo Tech-X Corporation Boulder CO USA Stanford Linear Accelerator Center Stanford CA USA

Summary form only given. Grid tools currently available are most often geared towards running batch-oriented dataset analysis jobs on a set of distributed heterogeneous computers in a production setting where the data is assumed to be in files, and do not automatically collect the results from multiple analysis jobs. This is insufficient for interactive dataset analysis, where complicated communications between the analysis jobs and the scheduler are required for interactivity and where datasets are abstracted from files, collections of files, database objects, and even virtual datasets for which only a generation algorithm exists. We describe a prototype for a system based on a set of grid services to provide interactive dataset analysis that extends the Globus Toolkit grid tools. An existing Java-based dataset analysis and visualization client tool are used to access the grid service and provide the interactive user interface for the client.

关键词： Data analysis Algorithm design and analysis distributed computing Grid computing Job production systems Processor scheduling Visual databases Scheduling algorithm Prototypes Java

来源：评论

学校读者我要写书评

暂无评论

A multiprocessor implementation of the total bandwidth server

A multiprocessor implementation of the total bandwidth serve...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： S. Baruch G. Lipari North Carolina Univ. Chapel Hill NC USA Scuola Superiore S. Anna Pisa Italy

Summary form only given. If a periodic task system is scheduled upon an identical multiprocessor platform using the earliest deadline first scheduling algorithm, it is known that the "schedulable utilization" - the largest bound such that any periodic task system with cumulative utilization no larger than this bound is guaranteed to be successfully scheduled - is strictly less than the capacity of the platform. The issue of using the excess processing capacity (the difference between the platform capacity and the schedulable utilization) is addressed here, and an algorithm is presented, and proven correct, that uses this excess capacity to provide guaranteed real-time service to aperiodic jobs.

关键词： Bandwidth Real time systems Scheduling algorithm Job design Processor scheduling Multiprocessing systems Terminology distributed processing

来源：评论

学校读者我要写书评

暂无评论

Flecc: a flexible cache coherence protocol for dynamic component-based systems

Flecc: a flexible cache coherence protocol for dynamic compo...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： A. Ivan Vijay Karamcheti Computer Science Department Courant Institute of Mathematical Sciences New York University New York NY USA

Summary form only given. An increasing number of distributed applications are currently being constructed as sets of connected components and dynamically deployed in wide area networks using frameworks such as CORBA, .NET, and Web Services. Such dynamic deployments enable applications to flexibly adapt to changes in client QoS requirements and network properties, but introduce a consistency problem because of replicated components. Ideally, the frameworks deploying the applications should ensure that the application consistency requirements are satisfied, even though the requirements can range from weak to strong and dynamically change at run-time. Thus, a key challenge is to design a flexible cache coherence protocol that uses application-specific information while still being application-neutral. We describe Flecc, an application-neutral cache coherence protocol used by a component-based framework (Partitionable Services Framework) to satisfy the consistency requirements of deployed applications. Flecc allows applications to specify appropriate consistency and granularity levels and define complex synchronization decisions as simple functions. We demonstrate the benefits of our cache coherence protocol by analyzing the behavior of a component-based application modeling an airline reservation system.

关键词： Protocols distributed databases Web services Runtime Coherence File systems Switches Computer science Application software Wide area networks

来源：评论

学校读者我要写书评

暂无评论

Improved conditions for bounded tardiness under EPDF fair multiprocessor scheduling

Improved conditions for bounded tardiness under EPDF fair mu...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Uma Maheswari C. Devi J.H. Anderson Department of Computer Science The University of North Carolina Chapel Hill NC University of North Carolina at Asheville Asheville NC US Dept. of Comput. Sci. North Carolina Univ. Chapel Hill NC USA

Summary form only given. The earliest-pseudo-deadline-first (EPDF) Pfair algorithm is more efficient than other known Pfair scheduling algorithms, but is not optimal on more than two processors. Srinivasan and Anderson established a sufficient per-task utilization restriction for ensuring a tardiness of at most one quantum under EPDF. They also conjectured that a tardiness bound of one quantum applies to systems that are not restricted in any way. We present counterexamples that show that this conjecture is false. We also present sufficient utilization restrictions that are more liberal than theirs.

关键词： Processor scheduling Scheduling algorithm Costs Computer science Real time systems Quality of service Multimedia systems Resource management Degradation distributed processing

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for partially clairvoyant dispatchers

Distributed algorithms for partially clairvoyant dispatchers

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： K. Subramani K. Yellajyosula A. Osman LCSEE West Virginia University Morgantown WV USA CSE University of Minnesota Minneapolis MN USA

Summary form only given. Real-time systems are finding use in complex and dynamic environments such as cruise controllers, life support systems, nuclear reactors, etc., These systems have separate components that sense, control and stabilize the environment towards achieving the mission or target. These consociate components synchronize, compute and control themselves locally or have a centralized component to do the above. distributed computing techniques improve the overall performance and reliability of large real-time systems with spread components. We propose and evaluate three distributed dispatching algorithms for partially clairvoyant schedules. For a job set of size n, the algorithms have dispatch times of O(1) per job. In the first algorithm, one processor executes all the jobs and other processors compute the dispatch functions. This scenario simplifies design and is better in situations where one processor controls all the devices. For the other algorithms, all the processors execute jobs assigned to them and compute the dispatch functions in a certain defined order; which is a plausible scenario in distributed controlling. We create various test-cases to test the algorithms due to the unavailability of benchmarks.

关键词： distributed algorithms Real time systems Control systems distributed computing Testing Centralized control Dispatching Scheduling algorithm Processor scheduling Process control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 25 26 27 28 29 30 31 32 33 34 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：