Adaptive solutions to the mutual exclusion problem

Summary Algorithms for mutual exclusion that adapt to the current degree of contention are developed. Afilter and a leader election algorithm form the basic building blocks. The algorithms achieve system response times that are independent of the total number of processes and governed instead by the current degree of contention. The final algorithm achieves a constant amortized system response time. Manhoi Choy was born in 1967 in Hong Kong. He received his B.Sc. in Electrical and Electronic Engineerings from the University of Hong Kong in 1989, and his M.Sc. in Computer Science from the University of California at Santa Barbara in 1991. Currently, he is working on his Ph.D. in Computer Science at the University of California at Santa Barbara. His research interests are in the areas of parallel and distributed systems, and distributed algorithms. Ambuj K. Singh is an Assistant Professor in the Department of Computer Science at the University of California, Santa Barbara. He received a Ph.D. in Computer Science from the University of Texas at Austin in 1989, an M.S. in Computer Science from Iowa State University in 1984, and a B.Tech. from the Indian Institute of Technology at Kharagpur in 1982. His research interests are in the areas of adaptive resource allocation, concurrent program development, and distributed shared memory.A preliminary version of the paper appeared in the 12th Annual ACM Symposium on Principles of Distributed ComputingWork supported in part by NSF grants CCR-9008628 and CCR-9223094     

Barrier layer effect of tantalum on the electromigration in sputtered copper films on hydrogen silsesguioxane and SiO2

As IC devices scale down to the submicron level, the resistance-capacitance (RC) time delays are the limitation to circuit speed. A solution is to use low dielectric constant materials and low resistivity materials. In this work, the influence of underlying barrier Ta on the electromigration (EM) of Cu on hydrogen silsesquioxane (HSQ) and SiO₂ substrates was investigated. The presence of a Ta barrier not only improves the adhesion between Cu and dielectrics, but also enhances the crystallinity of Cu film and improves the Cu electromigration resistance. The activation energy obtained suggests a grain boundary migration mechanism and the current exponent calculated indicates the Joule heating effect.     

A space- and time-efficient local-spin spin lock

A simple code transformation is presented that reduces the space complexity of Yang and Anderson's local-spin mutual exclusion algorithm. In both the original and the transformed algorithm, only atomic read and write instructions are used; each process generates Θ(logN) remote memory references per lock request, where N is the number of processes. The transformed algorithm uses Θ(N) distinct variables, which is clearly optimal.     

不含4圈的最大简单图边数的下界

证明了具有不小于6个顶点的不包含4圈的简单图的最大可能边数的下界是2n-5。     

N个振荡器相互注入锁定同步振荡系统

本文对Ｎ个振荡器相互注入锁定同步振荡系统提出了一种通用的分析方法。建立了该系统的完整非线性等效模型，导出了系统的状态方程。对于各种不同电路形式的振荡系统，只要将具体的电路参数代入，就可计算其输出功率，功率合成效率及工作频率等参数，从而使这类系统的计算机辅助分析和设计成为可能。     

一种智能卡口令认证方案的分析与改进

袁,吕提出了一种智能卡口令认证方案.在他们的方案中,用户能随意更改口令,远程系统不需要存储用户的口令表或验证表,并能防止重放攻击.作者指出袁-吕方案不能抵抗假冒攻击,并进行了改进.     

DKNNS:面向延迟敏感型应用的可扩展精确分布式K近邻搜索算法研究

为了降低用户访问延迟,延迟敏感型网络应用需要选择合适的邻近服务节点响应用户访问请求.分布式K近邻搜索通过可扩展的选择距任意用户节点邻近的K个服务节点,可以有效满足网络应用延迟优化的目的.已有工作在精确度以及可扩展性等方面存在不足.针对可扩展精确的K近邻搜索问题,文中提出了分布式K近邻搜索方法DKNNS(distributed K nearest neighbor search).DKNNS将大量的服务节点组织为邻近性感知的多级环,通过最远节点搜索机制选择优化的K近邻搜索初始化节点,然后基于回退方式快速的在目标节点邻近区域发现K个近邻.基于理论分析,模拟测试以及真实环境下的部署实验发现,在不同规模的节点集合下,DKNNS算法能够确定近似最优的K个服务节点.且DKNNS的查询延迟,查询开销均显著低于Meridian算法.最后,DKNNS的返回结果相对于Meridian具有较高的稳定性.     

大型数据集的多维变量关联性挖掘

为了探索多维数据集中各变量之间的关系,特别是非函数关系,对数据集所在的n维立方体的各个维度进行划分,在得到的n维网格中定义自然概率密度函数,以此得到数据集在特定划分下的互信息值。对所有的划分取互信息最大值,正态化后即为所定义的特征张量的一项,取特征张量在给定最大网格数下的最大项的值定义为MIC,它度量了多维变量间的关联程度。     

Consequences of the formation of Cooper-pairs near oxygen-deficient sites

In this investigation we consider the formation of Cooper pairs near the oxygen-deficient sites in Y-Ba-Cu-O ceramic superconductors which would give rise to an energy-dependent potential as seen by conduction charge carriers. It is shown that Cooper pairs could be formed under such conditions, resulting in a supercurrent. We use the Bogoliubov transformation technique to calculate the energy gap, the energy difference, and the transition temperature of the model superconductor using certain data obtained from previous experiments. Numerical analysis shows that the superconducting current can be explained by the presence of such oscillating Cooper pairs.     

Distributed match-making

In many distributed computing environments, processes are concurrently executed by nodes in a store- and-forward communication network. Distributed control issues as diverse as name server, mutual exclusion, and replicated data management involve making matches between such processes. We propose a formal problem called distributed match-making as the generic paradigm. Algorithms for distributed match-making are developed and the complexity is investigated in terms of messages and in terms of storage needed. Lower bounds on the complexity of distributed match-making are established. Optimal algorithms, or nearly optimal algorithms, are given for particular network topologies.The work of the second author was supported in part by the Office of Naval Research under Contract N00014-85-K-0168, by the Office of Army Research under Contract DAAG29-84-K-0058, by the National Science Foundation under Grant DCR-83-02391, and by the Defence Advanced Research Projects Agency (DARPA) under Contract N00014-83-K-0125. Current address of both authors: CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands.