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

GIGABIT LOCAL AREA NETWORKS - A SYSTEMS PERSPECTIVE

IEEE COMMUNICATIONS MAGAZINE 1992年第4期30卷 79-89页

作者： KUNG, HT Electrical Engineering and Computer Science Harvard University USA

A broad overview of gigabit local area networks (LANs) is presented from a systems perspective. Motivations and technical goals of gigabit LANs and challenges of coping with highly bursty traffic and large bandwidth mismatches between network links are described. The focus is on concerns unique to gigabit LANs, especially issues that differentiate them from gigabit wide area networks (WANs), metropolitan area networks (MANs), and lower-speed LANs. Major systems issues are discussed, and possible solutions, such as the virtual-connection architecture, are presented. The hardware technology required by gigabit LANs is illustrated by SONET components.< >

关键词： Local area networks Bandwidth Computer architecture Information technology Ethernet networks distributed computing Computer networks High-speed networks Operating systems Software standards

来源：评论

学校读者我要写书评

暂无评论

ON THE PERFORMANCE OF PROTOCOLS FOR COLLECTING RESPONSES OVER A MULTIPLE-ACCESS CHANNEL

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1995年第2-4期43卷 412-420页

作者： AMMAR, MH ROUSKAS, GN IEEE the College of Computing Georgia Institute of Technology

We consider a generalisation of the multiple sc cess problem where it is necessary to identify a subset of the ready users, not all. The problem is motivated by several ''response collection'' applications that arise in distributed computing and database systems. In these applications, a collector is interested in gathering a set of responses from a number of potential respondents. The collector and respondents communicate over a shared channel. We define three collection objectives and investigate a suite of protocols that can be used to achieve these objectives. The protocols are based on the use of Polling, TDMA, and Group Testing. Using a binomial respondent model we analyse and, where applicable, optimise the performance of the protocols. Our concern is with cost measures that reflect the computational load placed on the system, as well as the delay incurred for achieving a particular objective.

关键词： Access protocols distributed computing Database systems Time division multiple access Testing Performance analysis Costs Particle measurements Delay

来源：评论

学校读者我要写书评

暂无评论

Reducing the blocking in two-phase commit with backup sites

引用

INFORMATION PROCESSING LETTERS 2003年第1期86卷 39-47页

作者： Reddy, PK Kitsuregawa, M Univ Tokyo Inst Ind Sci Meguro Ku Tokyo 1538505 Japan

The blocking phenomena in two-phase commit (2PC) reduces the availability of the system as the blocked transactions keep all the resources until the recovery of the coordinator. The three-phase commit (3PC) protocol involves an extra round of message transmission to resolve the blocking problem. In this paper, we propose a backup commit (BC) protocol to reduce the blocking problem by attaching multiple backup sites to the coordinator site. In BC, after receiving responses from the participants, the coordinator quickly communicates the final decision to the backup sites, before it sends the final decision to the participants. When blocking occurs, the participant sites can terminate the transaction by consulting a backup site of the coordinator. The BC protocol resolves the blocking in most of the coordinator site failures without involving an expensive communication cycle as in 3PC. The simulation experiments indicate that the throughput performance of BC is close to 2PC. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： distributed database commit protocol two-phase commit three-phase commit non-blocking protocols distributed computing

来源：评论

学校读者我要写书评

暂无评论

Coarse-Grained Parallel Routing With Recursive Partitioning for FPGAs

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2021年第4期32卷 884-899页

作者： Shen, Minghua Luo, Guojie Xiao, Nong Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou 510275 Peoples R China Peking Univ Sch Elect Engn & Comp Sci Beijing 100871 Peoples R China

Routing is a very time-consuming stage in the FPGA design flow, significantly hindering the productivity. This article proposes CPRS, a coarse-grained parallel routing scheme in a distributed computing environment. First, we partition entire routing region to guide the assignment of nets for parallel processing. The partitioning is a recursive fashion, and at each recursive partitioning, the region is partitioned into two subregions forming three subsets of nets. The first subset consists of potentially dependent nets and they are distributed in different subregions. The remaining two subsets consist of potentially independent nets and they are distributed in their own subregions. Second, we route the nets of first subset in serial and process the remaining two subsets in parallel. The parallel processing is a coarse-grained fashion, which is implemented by MPI parallel programming model. Finally, we explore the optimization of both partitioning and parallel processing to further improve the overall speedup of parallel routing. In addition, we adopt MPI message to synchronize the intermediate results between different cores in parallel routing for a feasible solution. Experiments use a set of commonly used benchmarks to demonstrate the effectiveness of CPRS. Notably, CPRS achieves about 18x speedup on average using 32 processor cores with minor loss of quality, compared with the VTR 7.0 serial router. There is about 1.6x improvement over the state-of-the-art parallel router.

关键词： Routing Field programmable gate arrays Pins Nickel Parallel processing Optimization Synchronization distributed computing field programmable gate array (FPGA) routing parallel processing recursive partitioning

来源：评论

学校读者我要写书评

暂无评论

A top-down approach to architecting CPI component performance counters

引用

IEEE MICRO 2007年第1期27卷 84-93页

作者： Eyerman, Stijn Eeckhout, Lieven Karkhanis, Tejas Smith, James E. Univ Ghent Dept Elect & Informat Syst B-9000 Ghent Belgium Univ Wisconsin Dept Elect & Comp Engn Madison WI 53706 USA

Software developers can gain insight into software-hardware interactions by decomposing processor performance into individual cycles-per-instruction components that differentiate cycles consumed in active computation from those spent handling various miss events. Constructing accurate CPI components for out-of-order superscalar processors is complicated, however, because computation and miss event handling overlap. The authors' counter architecture, using an analytical superscalar performance model, handles overlap effects more accurately than existing methods.

关键词： COMPUTER scheduling TIME-sharing computer systems COMPUTER architecture distributed computing COMPUTER software development INFORMATION technology SYSTEMS development COMPUTER programming -- Management INTERVAL analysis (Mathematics)

来源：评论

学校读者我要写书评

暂无评论

Opportunistic scheduling and resources consolidation system based on a new economic model

引用

JOURNAL OF SUPERcomputing 2020年第12期76卷 9942-9975页

作者： Menouer, Tarek Cerin, Christophe Hsu, Ching-Hsien Umanis Res & Innovat 7 Rue Paul Vaillant Couturier Levallois Perret France Univ Sorbonne Paris Nord LIPN CNRS UMR 7030 99 Ave Jean Batiste Clement F-93430 Villetaneuse France Foshan Univ Sch Math & Big Data Foshan Peoples R China Asia Univ Dept Comp Sci & Informat Engn Taichung Taiwan China Med Univ China Med Univ Hosp Dept Med Res Taichung Taiwan

This paper presents a new opportunistic scheduling and resource consolidation system based on an economic model related to different service level agreements (SLAs) classes. The goal is to address the problem of companies that manage a private infrastructure of machines, i.e., a cloud platform and would like to optimize the scheduling of several requests submitted online by users. For the sake of simplicity of the presentation, the proposed economic model has two SLAs classes (qualitative and quantitative) with three Quality of Service for each SLA class (Premium, Advanced and Best effort). The consequence of this choice as well as the need to serve requests as they come have an impact on the algorithmic ways to consolidate an infrastructure. Indeed, our system proposes a new allocation heuristic that adapts the number of active machines in the cloud according to the global resources usage of all machines inside the infrastructure. This heuristic can be examined as a consolidation heuristic, based on the idea that the system can make reasonable choices, based on the SLAs, for the placement and the allocation of resources for each request. Experimentation with our system is conducted on Prezi (Web workload) and Google Cloud Data (HPC-oriented workload) traces, and they demonstrate the potential of our approach under different scenarios. From a methodological point of view, we propose a general framework which is limited in scope, for the sake of simplicity in reading the paper, with a small number of SLAs, but the idea can be extended to many more SLAs and performance metrics. In this way, the user or the provider operating the cloud have more latitude, thanks to our multi-criteria approach, to control the workload without a sacrifice on performance.

关键词： Scheduling Optimization distributed computing Cloud computing Service computing Consolidation of servers

来源：评论

学校读者我要写书评

暂无评论

Adaptive, segmented attenuation correction for whole-body PET imaging

引用

IEEE TRANSACTIONS ON NUCLEAR SCIENCE 1996年第1期43卷 331-336页

作者： Xu, M Cutler, PD Luk, WK CTI PET SYST INC KNOXVILLETN

A technique is presented for segmented attenuation correction in positron emission tomography (PET) based on the local thresholding technique (LTS) described previously. To accommodate the substantially different body sections encountered in whole-body PET, an adaptive thresholding has been added to yield more uniform results throughout the body. By evaluating the intensity distribution of a set of transverse transmission images, the algorithm determines an optimal threshold for separating two or three different groups or classes of similar pixels. Interclass variance is maximized and intra-class errors are minimized. The algorithm also switches automatically between a three-class mode (background, lungs/air pockets, soft tissue) and a two-class mode (background, soft tissue), thereby achieving more uniform segmentation where lung spaces and bowel air pockets are alternately present then absent from the volume of interest. The addition of adaptive thresholding virtually eliminates the need for operator intervention. The clinical implementation requires short-duration, count-limited, transmission images that would otherwise be too noisy for direct attenuation correction, Emission images corrected with adaptive LTS were shown to be equivalent, both quantitatively and qualitatively, to those corrected using conventional measured attenuation correction.

关键词： Image segmentation Whole-body PET Pixel Biological tissues Histograms Positron emission tomography Lungs Attenuation measurement Switches distributed computing

来源：评论

学校读者我要写书评

暂无评论

Nondeterministic polynomial time factoring in the tile assembly model

引用

THEORETICAL COMPUTER SCIENCE 2008年第1期395卷 3-23页

作者： Brun, Yuriy Univ So Calif Dept Comp Sci Los Angeles CA 90089 USA

Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplication, in the tile assembly model: a highly distributed parallel model of computation that may be implemented using molecules or a large computer network such as the Internet. Here, I present tile assembly model systems that factor numbers nondeterministically using e(l) distinct components. The computation takes advantage of nondeterminism, but theoretically, each of the nondeterministic paths is executed in parallel, yielding the solution in time linear in the size of the input, with high probability. I describe mechanisms for finding the successful solutions among the many parallel executions and explore bounds on the probability of such a nondeterministic system succeeding and prove that the probability can be made arbitrarily close to 1. (C) 2007 Elsevier B.V. All rights reserved.

关键词： self-assembly factoring tile assembly model crystal growth molecular computation natural computation distributed computing parallel computing nondeterministic computation

来源：评论

学校读者我要写书评

暂无评论

Research on Transparent Access Technology of Government Big Data

引用

TEHNICKI VJESNIK-TECHNICAL GAZETTE 2024年第3期31卷 715-725页

作者： Li, Honghui Xu, Yi Peng, Yunjuan Yang, Xiaorui Zhang, Dalin Fan, Jianping Sun, Jing Beijing Jiaotong Univ Sch Comp & Informat Technol Coll Beijing Jiaotong Univ 3 Shang Yuan VillageXizhimen Wai Beijing Peoples R China Beijing Jiaotong Univ Sch Software Engn Coll Beijing Jiaotong Univ 3 Shang Yuan VillageXizhimen Wai Beijing 100091 Peoples R China Chinese Acad Sci Shenzhen Inst Adv Technol 1068 Xueyuan Ave Shenzhen Peoples R China

E -governance is capable of driving the transition of government from an administrative power allocation of public resources to a citizen -service -oriented governance model. However, during this transformation, various governmental bodies often face the challenge of "data silos" caused by factors such as cross -regional, cross -business, and cross -departmental operations. Without altering the existing information platforms, transparent access technology serves as a key solution for data access within egovernance systems. It enables convenient access to information resources stored in different mediums and formats, facilitating the sharing and consolidation of information and data within and between governmental departments, thereby addressing the issue of "data silos" and enhancing the comprehensive service capabilities of e -governance. This paper firstly provides an overview of the concept, levels, characteristics, and application scenarios of transparent access to government big data. Secondly, it conducts a comprehensive comparative analysis of transparent access technologies in the context of cloud computing and big data. Lastly, based on the requirements of various transparent access technologies and the application of transparent access to government big data, this paper proposes a visionary framework for transparent access to government big data based on cross -domain semantics and channel coupling. This framework includes modules for cross -domain semantic interoperability, coupling of heterogeneous information channels based on knowledge graph, and tracing of multi -source heterogeneous data, aiming to provide innovative solutions for achieving transparent access to government big data.

关键词： cloud computing data island distributed computing government big data transparent access

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive configuration of visualization pipeline over wide-area networks

引用

IEEE TRANSACTIONS ON COMPUTERS 2008年第1期57卷 55-68页

作者： Wu, Qishi Gao, Jinzhu Zhu, Mengxia Rao, Nageswara S. V. Huang, Jian Iyengar, S. Sitharama Univ Memphis Dept Comp Sci Memphis TN 38152 USA Univ Minnesota Div Sci & Math Morris MN 56267 USA So Illinois Univ Dept Comp Sci Carbondale IL 62901 USA Oak Ridge Natl Lab Comp Sci & Math Div Oak Ridge TN 37831 USA Univ Tennessee Dept Comp Sci Knoxville TN 37996 USA Louisiana State Univ Dept Comp Sci Baton Rouge LA 70802 USA

Next-generation scientific applications require the capability to visualize large archival data sets or on-going computer simulations of physical and other phenomena over wide-area network connections. To minimize the latency in interactive visualizations across wide-area networks, we propose an approach that adaptively decomposes and maps the visualization pipeline onto a set of strategically selected network nodes. This scheme is realized by grouping the modules that implement visualization and networking subtasks and mapping them onto computing nodes with possibly disparate computing capabilities and network connections. Using estimates for communication and processing times of subtasks, we present a polynomial-time algorithm to compute a decomposition and mapping to achieve minimum end-to-end delay of the visualization pipeline. We present experimental results using geographically distributed deployments to demonstrate the effectiveness of this method in visualizing data sets from three application domains.

关键词： distributed computing remote visualization visualization pipeline bandwidth measurement network mapping

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：