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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

71 篇 会议
3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

53 篇 工学
- 31 篇 计算机科学与技术...
- 30 篇 软件工程
- 11 篇 电气工程
- 4 篇 信息与通信工程
- 3 篇 动力工程及工程热...
- 3 篇 电子科学与技术（可...
- 3 篇 环境科学与工程（可...
- 2 篇 机械工程
- 2 篇 控制科学与工程
- 2 篇 交通运输工程
- 2 篇 航空宇航科学与技...
- 1 篇 力学（可授工学、理...
- 1 篇 仪器科学与技术
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 水利工程
9 篇 管理学
- 6 篇 管理科学与工程(可...
- 5 篇 工商管理
- 3 篇 图书情报与档案管...
5 篇 理学
- 2 篇 系统科学
- 1 篇 数学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 大气科学
2 篇 经济学
- 2 篇 应用经济学
1 篇 法学
- 1 篇 法学
1 篇 军事学

主题

2 篇 scalability
2 篇 database systems
2 篇 public key crypt...
2 篇 safety
2 篇 outages
2 篇 program processo...
2 篇 specifications
2 篇 application prog...
2 篇 cgra
2 篇 costs
2 篇 semantics
2 篇 clocks
2 篇 multicore
2 篇 investments
2 篇 testing
2 篇 hevc
2 篇 machinery
2 篇 virtual machine
1 篇 activated sludge
1 篇 semiconductor de...

机构

3 篇 mit comp sci lab...
2 篇 consystant desig...
2 篇 mit laboratory f...
2 篇 mit csail cambri...
2 篇 carnegie mellon ...
2 篇 department of co...
2 篇 carnegie mellon ...
1 篇 intelligent syst...
1 篇 intertrust techn...
1 篇 cam lab. departm...
1 篇 mpi sws saarbruc...
1 篇 computer science...
1 篇 computing labora...
1 篇 commissariat ene...
1 篇 inst tecnol aero...
1 篇 m.i.t. laborator...
1 篇 facebook 1 hacke...
1 篇 carnegie mellon ...
1 篇 univ british col...
1 篇 boston coll bost...

作者

3 篇 kaashoek m. fran...
2 篇 nurmi jari
2 篇 ganger gregory r...
2 篇 schlosser steven...
2 篇 griffin john lin...
2 篇 m. frans kaashoe...
2 篇 zeldovich nickol...
2 篇 chajed tej
2 篇 nouri sajjad
2 篇 nagle david f.
2 篇 howell jon
2 篇 fu kevin
2 篇 tassarotti josep...
2 篇 theng mark
2 篇 gregory r. gange...
2 篇 mazières david
1 篇 rahman n.a.
1 篇 milojicic d
1 篇 liskov barbara
1 篇 choi tae-hoon

语言

74 篇 英文

检索条件"任意字段=4th Symposium on Operating System Design and Implementation, OSDI 2000"

共 74 条记录，以下是1-10 订阅

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

详细简洁

排序：

INTOS: Persistent Embedded operating system and Language Support for Multi-threaded Intermittent Computing 18

INTOS: Persistent Embedded Operating System and Language Sup...

引用

18th USENIX symposium on operating systems design and implementation (osdi)

作者： Wu, Yilun Min, Byounguk Ismail, Mohannad Xiong, Wenjie Jung, Changhee Lee, Dongyoon SUNY Stony Brook Stony Brook NY 11794 USA Purdue Univ W Lafayette IN 47907 USA Virginia Tech Blacksburg VA USA

ISBN: (纸本)9781939133403

this paper introduces INTOS, an embedded operating system and language support for multi-threaded intermittent computing on a battery-less energy-harvesting platform. INTOS simplifies programming with a traditional "thread" and a "transaction" with automatic undo-logging of persistent objects in non-volatile memory. While INTOS allows the use of volatile memory for performance and energy efficiency, conventional transactions do not ensure crash consistency of volatile register and memory states. To address this challenge, INTOS proposes a novel replay-and-bypass approach, eliminating the need for users to checkpoint volatile states. Upon power restoration, INTOS recovers non-volatile states by undoing the updates of power-interrupted transactions. To reconstruct volatile states, INTOS restarts each thread bypassing committed transactions and system calls by returning recorded results without re-execution. INTOS seeks to build a persistent, full-fledged embedded OS, supporting priority-based preemptive multithreading while ensuring crash consistency even if power failure occurs during a system call or while some threads are blocked. Experiments on a commodity platform MSP430FR5994 show that when subjected to an extreme power failure frequency of 1 ms, INTOS demonstrated 1.24x lower latency and 1.29x less energy consumption than prior work leveraging idempotent processing. this trend turns out to be more pronounced on Apollo 4 Blue Plus.

关键词： Multitasking

来源：评论

学校读者我要写书评

暂无评论

Sharding the State Machine: Automated Modular Reasoning for Complex Concurrent systems 17

Sharding the State Machine: Automated Modular Reasoning for ...

引用

17th USENIX symposium on operating systems design and implementation (osdi)

作者： Hance, Travis Zhou, Yi Lattuada, Andrea Achermann, Reto Conway, Alex Stutsman, Ryan Zellweger, Gerd Hawblitzel, Chris Howell, Jon Parno, Bryan Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ British Columbia Vancouver BC V6T1Z4 Canada VMware Res Zurich Switzerland Univ Utah Salt Lake City UT USA Microsoft Res Redmond WA USA

ISBN: (纸本)9781939133342

We present IronSync, an automated verification framework for concurrent code with shared memory. IronSync scales to complex systems by splitting system-wide proofs into isolated concerns such that each can be substantially automated. As a starting point, IronSync's ownership type system allows a developer to straightforwardly prove both data safety and the logical correctness of thread-local operations. IronSync then introduces the concept of a Localized Transition system, which connects the correctness of local actions to the correctness of the entire system. We demonstrate IronSync by verifying two state-of-the-art concurrent systems comprising thousands of lines: a library for black-box replication on NUMA architectures, and a highly concurrent page cache.

关键词： Automation

来源：评论

学校读者我要写书评

暂无评论

Verifying the DaisyNFS concurrent and crash-safe file system with sequential reasoning 16

Verifying the DaisyNFS concurrent and crash-safe file system...

引用

16th USENIX symposium on operating systems design and implementation (osdi)

作者： Chajed, Tej Tassarotti, Joseph theng, Mark Kaashoek, M. Frans Zeldovich, Nickolai MIT CSAIL Cambridge MA 02139 USA Boston Coll Boston MA USA

ISBN: (纸本)9781939133281

this paper develops a new approach to verifying a performant file system that isolates crash safety and concurrency reasoning to a transaction system that gives atomic access to the disk, so that the rest of the file system can be verified with sequential reasoning. We demonstrate this approach in DaisyNFS, a Network File system (NFS) server written in Go that runs on top of a disk. DaisyNFS uses GoTxn, a new verified, concurrent transaction system that extends GoJournal [9] with two-phase locking and an allocator. the transaction system's specification formalizes under what conditions transactions can be verified with only sequential reasoning, and comes with a mechanized proof in Coq [37] that connects the specification to the implementation. As evidence that proofs enjoy sequential reasoning, DaisyNFS uses Dafny [26], a sequential verification language, to implement and verify all the NFS operations on top of GoTxn. the sequential proofs helped achieve a number of good properties in DaisyNFS: easy incremental development (for example, adding support for large files), a relatively short proof (only 2x as many lines of proof as code), and a performant implementation (at least 60% the throughput of the Linux NFS server exporting ext4 across a variety of benchmarks).

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

FAERY: An FPGA-accelerated Embedding-based Retrieval system 16

FAERY: An FPGA-accelerated Embedding-based Retrieval System

引用

16th USENIX symposium on operating systems design and implementation (osdi)

作者： Zeng, Chaoliang Luo, Layong Ning, Qingsong Han, Yaodong Jiang, Yuhang Tang, Ding Wang, Zilong Chen, Kai Guo, Chuanxiong Hong Kong Univ Sci & Technol Hong Kong Peoples R China ByteDance Beijing Peoples R China

ISBN: (纸本)9781939133281

Embedding-based retrieval (EBR) is widely used in recommendation systems to retrieve thousands of relevant candidates from a large corpus with millions or more items. A good EBR system needs to achieve both high throughput and low latency, as high throughput usually means cost saving and low latency improves user experience. Unfortunately, the performance of existing CPU- and GPU-based EBR are far from optimal due to their inherent architectural limitations. In this paper, we first study how an ideal yet practical EBR system works, and then design FAERY, an FPGA-accelerated EBR, which achieves the optimal performance of the practically ideal EBR system. FAERY is composed of three key components: It uses a high bandwidth HBM for memory bandwidth-intensive corpus scanning, a data parallelism approach for similarity calculation, and a pipeline-based approach for K-selection. To further reduce hardware resources, FAERY introduces a filter to early drop the non-Top-K items. Experiments show that the degraded FAERY with the same memory bandwidth of GPU still achieves 1:21 x-12:27 x lower latency and up to 4:29 x higher throughput under a latency target of 10 ms than GPU-based EBR.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

GoJournal: a verified, concurrent, crash-safe journaling system 15

GoJournal: a verified, concurrent, crash-safe journaling sys...

引用

USENIX Annual Technical Conference / 15th USENIX symposium on operating systems design and implementation (osdi)

作者： Chajed, Tej Tassarotti, Joseph theng, Mark Jung, Ralf Kaashoek, M. Frans Zeldovich, Nickolai MIT CSAIL Cambridge MA 02139 USA Boston Coll Newton MA USA MPI SWS Saarbrucken Germany

ISBN: (纸本)9781939133229

the main contribution of this paper is GoJournal, a verified, concurrent journaling system that provides atomicity for storage applications, together with Perennial 2.0, a framework for formally specifying and verifying concurrent crash-safe systems. GoJournal's goal is to bring the advantages of journaling for code to specs and proofs. Perennial 2.0 makes this possible by introducing several techniques to formalize GoJournal's specification and to manage the complexity in the proof of GoJournal's implementation. Lifting predicates and crash framing make the specification easy to use for developers, and logically atomic crash specifications allow for modular reasoning in GoJournal, making the proof tractable despite complex concurrency and crash interleavings. GoJournal is implemented in Go, and Perennial is implemented in the Coq proof assistant. While verifying GoJournal, we found one serious concurrency bug, even though GoJournal has many unit tests. We built a functional NFSv3 server, called GoNFS, to use GoJournal. Performance experiments show that GoNFS provides similar performance (e.g., at least 90% throughput across several benchmarks on an NVMe disk) to Linux's NFS server exporting an ext4 file system, suggesting that GoJournal is a competitive journaling system. We also verified a simple NFS server using GoJournal's specs, which confirms that they are helpful for application verification: a significant part of the proof doesn't have to consider concurrency and crashes.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

design and implementation of a Dual-Interface Intelligent Assistant for openEuler with NLP-Powered Terminal Support

Design and Implementation of a Dual-Interface Intelligent As...

引用

Computer Applications and Information Technology (ISCAIT), International symposium on

作者： Yuqing Tan Lihua Song Tianyu Wang Department of Computer Science North China University of Technology Shijingshan District Beijing China

ISBN: (数字)9798331542856

ISBN: (纸本)9798331542863

OpenEuler operating system has made remarkable progress in the technical level, but its complexity and rich functions also pose challenges for users in terms of learning and usage. To address this issue, this paper designs and implements an intelligent assistant tool tailored for the openEuler operating system. In terms of technology selection, the web side adopts frontend technologies such as Vue3+Element-Plus+Axios, and the backend technology stack is SpringBoot3+Mybatis+Redis, which supports multi-condition queries and CRUD (Create, Read, Update, Delete) functions, enabling users to participate in the maintenance of the knowledge base. the tool side uses the framework of Textual, TF-IDF algorithm and cosine similarity algorithm to build a text matching system. By calculating the similarity between user-input keywords and existing texts and sorting the results, it achieves efficient and accurate text matching. Experimental results demonstrate that the tool offers high accuracy and fast response times, providing an excellent user experience. the innovation of this tool lies in its support for both web and terminal interfaces, integrating advanced natural language processing technologies to meet the complex requirements of the OpenEuler operating system. It offers users an intelligent and convenient tool that fills the gap in the field of intelligent assistant tools for OpenEuler.

关键词： Training Technological innovation Accuracy operating systems Knowledge based systems User experience Maintenance Time factors Monitoring Sorting

来源：评论

学校读者我要写书评

暂无评论

aDFS: An Almost Depth-First-Search Distributed Graph-Querying system

aDFS: An Almost Depth-First-Search Distributed Graph-Queryin...

引用

USENIX Annual Technical Conference / 15th USENIX symposium on operating systems design and implementation (osdi)

作者： Trigonakis, Vasileios Lozi, Jean-Pierre Faltin, Tomas Roth, Nicholas P. Psaroudakis, Iraklis Delamare, Arnaud Haprian, Vlad Iorgulescu, Calin Koupy, Petr Lee, Jinsoo Hong, Sungpack Chafi, Hassan Oracle Labs Santa Clara CA 95054 USA Charles Univ Prague Prague Czech Republic KUNGFU AI Austin TX USA

ISBN: (纸本)9781939133236

Graph processing is an invaluable tool for data analytics. In particular, pattern-matching queries enable flexible graph exploration and analysis, similar to what SQL provides for relational databases. Graph queries focus on following connections in the data;they are a challenging workload because even seemingly trivial queries can easily produce billions of intermediate results and irregular data access patterns. In this paper, we introduce aDFS: A distributed graphquerying system that can process practically any query fully in memory, while maintaining bounded runtime memory consumption. To achieve this behavior, aDFS relies on (i) almost depth-first (aDFS) graph exploration with some breadth-first characteristics for performance, and (ii) non-blocking dispatching of intermediate results to remote edges. We evaluate aDFS against state-of-the-art graph-querying (Neo4J and GraphFrames for Apache Spark), graph-mining (G-Miner, Fractal, and Peregrine), as well as dataflow joins (BiGJoin), and show that aDFS significantly outperforms prior work on a diverse selection of workloads.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Fast RTO Applied to a Commercial SOFC system 12

Fast RTO Applied to a Commercial SOFC System

引用

12th International-Federation-of-Automatic-Control (IFAC) symposium on Dynamics and Control of Process systems including Biosystems (DYCOPS)

作者： Ferreira, T. de Avila Wuillemin, Z. Marchetti, A. G. Bonvin, D. Ecole Polytech Fed Lausanne Lab Automat CH-1015 Lausanne Switzerland SOLIDpower SA CH-1400 Yverdon Switzerland Univ Nacl Rosario CONICET CIFASIS S2000EZP Rosario Santa Fe Argentina

the experimental implementation of real-time optimization (RTO) to a commercial solid-oxide fuel-cell (SOFC) system is reported in this paper. the goal of RTO is to maximize the system efficiency at steady state subject to several operating constraints. the proposed RTO strategy is a constraint-adaptation approach, which consists in adding bias correction terms to the constraints in the optimization problem. these bias terms are estimated during operation using transient measurements in combination with a dynamic model. the scheme enforces plant optimality by continuously detecting and tracking the set of active constraints. this approach drives the fuel-cell system quickly to the desired power demand, while maximizing the efficiency and paying attention to constraint satisfaction. As such, this RTO scheme has the ability to both control and optimize fuel-cell systems. this experimental system reached about 65% efficiency. In addition, it was possible to deal with slow drifts such as degradation without compromising on optimality. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： SOFC system real-time optimization fast RTO constraint adaptation plant-model mismatch

来源：评论

学校读者我要写书评

暂无评论

Sharding the Shards: Managing Datastore Locality at Scale with Akkio 13

Sharding the Shards: Managing Datastore Locality at Scale wi...

引用

13th USENIX symposium on operating systems design and implementation (osdi)

作者： Annamalai, Muthukaruppan Ravichandran, Kaushik Srinivas, Harish Zinkovsky, Igor Pan, Luning Savor, Tony Naglel, David Stumm, Michael Facebook 1 Hacker Way Menlo Pk CA 94025 USA Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada

ISBN: (纸本)9781939133083

Akkio is a locality management service layered between client applications and distributed datastore systems. It determines how and when to migrate data to reduce response times and resource usage. Akkio primarily targets multi-datacenter geo-distributed datastore systems. Its design was motivated by the observation that many of Facebook's frequently accessed datasets have low R/W ratios that are not well served by distributed caches or full replication. Akkio's unit of migration is called a mu-shard. Each mu-shard is designed to contain related data with some degree of access locality. At Facebook, mu-shards have become a first-class abstraction. Akkio went into production at Facebook in 2014, and it currently manages similar to 100PB of data. Measurements from our production environment show that Akkio reduces access latencies by up to 50%, cross-datacenter traffic by up to 50%, and storage footprint by up to 40% compared to reasonable alternatives. Akkio is scalable: it can support trillions of mu-shards and process many 10's of millions of data access requests per second. And it is portable: it currently supports five datastore systems.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Energy-Delay Trade-Offs in Instruction Register File design 4

Energy-Delay Trade-Offs in Instruction Register File Design

引用

4th IEEE Nordic Circuits and systems Conference (NORCAS) / NORCHIP and International symposium of system-on-Chip (SoC)

作者： Multanen, Joonas Kultala, Heikki Jaaskelainen, Pekka Tampere Univ Technol Tampere Finland

ISBN: (纸本)9781538676561

In order to decrease latency and energy consumption, processors use hierarchical memory systems to store temporally and spatially related instructions close to the core. Instruction register file (IRF) is an energy-efficient solution for the lowest level in the instruction memory hierarcy. Being compiler-controlled, it removes the area and energy overheads involved in cache tag checking and adds flexibility in the separation of the instruction fetch and execution. In this paper, we systematically evaluate for the first time the effect of three IRF design variations on energy and delay against an unoptimized baseline IRF. Having instruction fetch and decode with IRF in the same pipeline stage allows minimal delay branching, but results in low operating clock frequency and impaired energy delay product compared to splitting them into two stages. Assuring instruction presence in IRF before execution with software reduces the area and increases maximum clock frequency compared to assurance with hardware, but requires compiler analysis. With a proposed compiler-analyzed instruction placement and co-designed hardware implementation, energy consumption with the best IRF variant is reduced by 9% on average with EEMBC Coremark and CHStone benchmaks. the energy delay product is improved by 23% when compared to the baseline IRF approach.

关键词： Registers Program processors Delays Clocks Hardware Task analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：