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

international symposium on VLSI Technology, systems and Applications

作者： ChiaHua Ho Ming-Daou Lee Chen-Ling Pan Erh-Kun Lai Yeong-Der Yao Kuang-Yeu Hsieh Rich Liu Chih-Yuan Lu Macronix International Company Limited Hsinchu Taiwan Department of Materials Science and Engineering National Chiao Tung University Hsinchu Taiwan Institute of Physics National Chung Cheng University Chiayi Taiwan Institute of Physics Academia Sinica Taipei Taiwan

ISBN: (纸本)142440584X

We report the first demonstration of a multilevel cell (MLC) resistance device using a self-aligned WO x film prepared by plasma oxidation. The 2-bit/cell operation is achieved by applying a series of 1.5 V programming pulses. The device shows high thermal stability and good data retention. The resistance change can be attributed to variable-range hopping and Ohmic transport mechanisms. This device has the potential for future low-voltage, 3-dimensional nonvolatile memory with multiple bits per layer. In addition, no additional mask is needed to form the self-aligned device.

关键词： Thermal resistance Thermal stability Voltage Physics Oxidation Metal-insulator structures Electrodes Tellurium Tin Materials science and technology

来源：评论

学校读者我要写书评

暂无评论

SWARM: A Parallel programming Framework for Multicore Processors

SWARM: A Parallel Programming Framework for Multicore Proces...

引用

international symposium on Parallel and Distributed Processing (IPDPS)

作者： David A. Bader Varun Kanade Kamesh Madduri College of Computing Georgia Institute of Technology Atlanta GA USA

Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued performance on multicore processors now requires the exploitation of concurrency at the algorithmic level. In this paper, we identify key issues in algorithm design for multicore processors and propose a computational model for these systems. We introduce SWARM (software and algorithms for running on multi-core), a portable open-source parallel library of basic primitives that fully exploit multicore processors. Using this framework, we have implemented efficient parallel algorithms for important primitive operations such as prefix-sums, pointer-jumping, symmetry breaking, and list ranking; for combinatorial problems such as sorting and selection; for parallel graph theoretic algorithms such as spanning tree, minimum spanning tree, graph decomposition, and tree contraction; and for computational genomics applications such as maximum parsimony. The main contributions of this paper are the design of the SWARM multicore framework, the presentation of a multicore algorithmic model, and validation results for this model. SWARM is freely available as open-source from http://***/.

关键词： Parallel programming Multicore processing Open source software Tree graphs Concurrent computing Algorithm design and analysis Microprocessors Computer architecture Process design Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Simple and efficient numerical evaluation of near-hypersingular integrals

Simple and efficient numerical evaluation of near-hypersingu...

引用

Antennas and Propagation Society international symposium

作者： Patrick W. Fink Donald R. Wilton Michael A. Khayat Electromagnetic Systems Branch NASA-Johnson Space Center Houston TX USA Department of Electrical and Computer Engineering University of Houston TX USA

ISBN: (纸本)9781424408771;1424408776

A technique for efficient numerical evaluation of hypersingular kernels is demonstrated. It is also shown that weaker singularities may be handled efficiently by the same technique. As the projection of the observation point approaches an edge of the source element, the efficiency of the technique is reduced. Treatment of this case remains as future work. Additional work also includes extending the technique to handle projections of the observation point falling outside the source element.

关键词： Integral equations Object oriented programming Kernel Green's function methods NASA Boundary element methods Surface treatment Jacobian matrices Convergence of numerical methods Geometry

来源：评论

学校读者我要写书评

暂无评论

Computing the 3D Voronoi Diagram Robustly: An Easy Explanation

Computing the 3D Voronoi Diagram Robustly: An Easy Explanati...

引用

international symposium on Voronoi Diagrams in Science and Engineering (ISVD)

作者： Hugo Ledoux OTB-section GIS Technology Delft University of Technnology Delft Netherlands

Many algorithms exist for computing the 3D Voronoi diagram, but in most cases they assume that the input is in general position. Because of the many degeneracies that arise in 3D geometric computing, their implementation is still problematic in practice. In this paper, I describe a simple 3D Voronoi diagram (and Delaunay tetrahedralization) algorithm, and I explain, by giving as many details and insights as possible, how to ensure that it outputs a correct structure, regardless of the spatial distribution of the points in the input.

关键词： Robustness Algorithm design and analysis programming profession Data mining Geographic Information systems Distributed computing Computational geometry Sorting Application software Data structures

来源：评论

学校读者我要写书评

暂无评论

A Customized Open Source Content Management System to Support Collaborative Distance Learning: The J@LON Platform

A Customized Open Source Content Management System to Suppor...

引用

Annual IEEE symposium on Computer-Based Medical systems

作者： Pascal Staccini Christophe Bordonado Jerome Alet Michel Joubert Jean-Charles Dufour Marius Fieschi LabSTICs Faculté de Médecine Université Nice Sophia-Antipolis France LERTIM Faculté de Médecine Université de la Méditerranée France

Aimed at supporting a distance learning graduate course in "Quality and Risk Management in Healthcare" (ESSQU@D course), a collaborative learning environment has been designed and implemented (J@LON platform). This full Web based authoring tool is based on an object-oriented programming framework (Zope) and implements both native and customized features of a content management product (Plone). The system handles a core component, called a lesson. It allows teachers to aggregate single resources (documents, quiz, glossary term...). It provides students with a consistent and structured view of the content of a lesson. The Web based platform was initially developed to meet specific needs of the medicine campus. It has been extended to support the whole publishing process of pedagogical resources in the university. Its integration in the university information system is partly achieved with single sign on features (CAS authentication). Access to a centralized description of curricula still remains to enhance: it depends on an institutional reviewing of the database according to the policies of License, Master, and Doctorate schema. A multidisciplinary configuration of the platform is available, allowing students and teachers to be involved in several courses handled by a same instance of Zope / Plone.

关键词： Content management Collaboration Computer aided instruction Risk management Medical services Collaborative work Object oriented programming Aggregates Terminology Publishing

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 1st workshop on tools, operating systems, and programming models for developing reliable systems (TOPMoDRS)

Proceedings - 21st International Parallel and Distributed Pr...

引用

Proceedings - 21st international Parallel and Distributed Processing symposium, IPDPS 2007;Abstracts and CD-ROM 2007年

作者： ŢǍpuş, Cristian Hickey, Jason Jhala, Ranjit Kiniry, Joe Lerner, Sorin Medvidovic, Nenad Morin, Christine Nita-Rotaru, Cristina Nogin, Aleksey Tapus, Nicolae Tamir, Yuval Hsu, Israel Le, Michael Center for Advanced Computing Research United States Caltech United States University of California San Diego United States University College Dublin Ireland University of Southern California United States INRIA France Purdue University United States HRL Laboratories United States Politehnica University of Bucharest Romania United States

来源：评论

学校读者我要写书评

暂无评论

Applying Autonomic Computing with Open Standardized Resource Interface WSDM to Managing Multi-vendor IT systems

Applying Autonomic Computing with Open Standardized Resource...

引用

IFIP/IEEE international symposium on Integrated Network Management

作者： Yoshikazu Satoh Yuhsuke Kaneyasu Jung-kook Hong Yuhichi Komatsu Kazuo Iwano Satoshi Tutiya Tsuneo Katsuyama Hiroshi Yoshida Software Development Laboratory-Yamato IBM Japan Limited Yamato Kanagawa Japan Fujitsu Laboratories Limited Kawasaki Japan

ISBN: (纸本)1424407982

As IT systems grow bigger and complex, they are comprised of many resources supplied by various vendors. Also, the Internet accelerates inter-enterprise business transactions and IT systems are connected each other. Consequently enterprise application systems are becoming a kind of large business process across multiple vendors. This transformation will also bring new type of complexity and difficulties to enterprise IT system management. Having awareness of these issues, IBM and Fujitsu have been collaborating on standardization effort for various areas of autonomic computing technologies. Autonomic computing and open standard interface are an effective approach to deal with these challenges. The initial areas of collaboration are common event format and interface for action to manage IT resources. hi this presentation, we show how an autonomic manager can solve these issues with using an open standard, WSDM (Web Service Distributed Management). We demonstrate the autonomic manager that behaves based on defined policy, continuously monitors systems, handles events and takes actions through WSDM interface in Multi-vendor IT systems.

关键词： Computer interfaces Resource management Technology management Collaboration Laboratories Standardization Web services Service oriented architecture Costs programming

来源：评论

学校读者我要写书评

暂无评论

Revisiting Deterministic Multithreading Strategies

Revisiting Deterministic Multithreading Strategies

引用

international symposium on Parallel and Distributed Processing (IPDPS)

作者： Jorg Domaschka Andreas I. Schmied Hans P. Reiser Franz J. Hauck Institute of Distributed Systems Ulm University Ulm Germany

Deterministic behaviour is a prerequisite for most approaches to object replication. In order to avoid the non-determinism of multithreading, many object replication systems are limited to using sequential method execution. In this paper, we survey existing application-level scheduling algorithms that enable deterministic concurrent execution of object methods. Multithreading leads to a more efficient execution on multiple CPUs and multi-core CPUs, and it enables the object programmer to use condition variables for coordination between multiple invocations. In existing algorithms, a thread may only start or resume if there are no potentially nondeterministic conflicts with other running threads. A decision only based on past actions, without knowledge of future behaviour, must use a pessimistic strategy that can cause unnecessary restrictions to concurrency. Using a priori knowledge about future actions of a thread allows increasing the concurrency. We propose static code analysis as a way for predicting the lock acquisitions of object methods.

关键词： Multithreading Yarn Scheduling algorithm Concurrent computing Middleware Resumes Java Information analysis Algorithm design and analysis programming profession

来源：评论

学校读者我要写书评

暂无评论

A Configuration Control Mechanism Based on Concurrency Level for a Reconfigurable Consistency Algorithm

A Configuration Control Mechanism Based on Concurrency Level...

引用

international symposium on Parallel and Distributed Processing (IPDPS)

作者： Christiane V. Pousa Luis F. W. Goes Carlos A. P. S. Martins Computational and Digital Systems Group Pontifical Catholic University of Minas Gerais Belo Horizonte Brazil Computational and Digital Systems Group Pontifical Catholic University of Minas Gerais Belo Brazil

A Reconfigurable Consistency Algorithm (RCA) is an algorithm that guarantees the consistency in Distributed Shared Memory (DSM) systems. In a RCA, there is a Configuration Control Layer (CCL) that is responsible for selecting the most suitable RCA configuration (behavior) for a specific workload and DSM system. In previous works, we defined an upper bound performance for RCA based on an ideal CCL, which knows apriori the best configuration for each situation. This ideal CCL is based on a set of workloads characteristics that, in most situations, are difficult to extract from the applications (percentage of shared write and read operations and sharing patterns). In this paper we propose, develop and present a heuristical configuration control mechanism for the CCL implementation. This mechanism is based on an easily obtained applications parameter, the concurrency level. Our results show that this configuration control mechanism improves the RCA performance in 15%, on average, compared to other traditional consistency algorithms. Furthermore, the CCL with this mechanism is independent from the workload and DSM system specific characteristics, like sharing patterns and percentage of writes and reads.

关键词： Concurrent computing Control systems Distributed computing Digital systems Algorithm design and analysis Upper bound Contracts Parallel programming Operating systems Performance analysis

来源：评论

学校读者我要写书评

暂无评论

A Key-based Adaptive Transactional Memory Executor

A Key-based Adaptive Transactional Memory Executor

引用

international symposium on Parallel and Distributed Processing (IPDPS)

作者： Tongxin Bai Xipeng Shen Chengliang Zhang William N. Scherer Chen Ding Michael L. Scott University of Rochester USA The College of William and Mary USA

Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operations proceed in parallel. Many of these structures take the abstract form of a dictionary, in which each transaction is associated with a search key. By regrouping transactions based on their keys, one may improve locality and reduce conflicts among parallel transactions. In this paper, we present an executor that partitions transactions among available processors. Our key-based adaptive partitioning monitors incoming transactions, estimates the probability distribution of their keys, and adaptively determines the (usually nonuniform) partitions. By comparing the adaptive partitioning with uniform partitioning and round-robin keyless partitioning on a 16-processor SunFire 6800 machine, we demonstrate that key-based adaptive partitioning significantly improves the throughput of finegrained parallel operations on concurrent data structures.

关键词： Yarn Computer science Scheduling programming profession Dictionaries Throughput Multicore processing Java Educational institutions Software systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：