IEEEXtreme is an IEEE Student Activities Committee initiative to create a worldwide programming contest for IEEE Student Branches. The success of the past editions and the way IEEEXtreme is evolving, suggests that it ...
详细信息
As memory transactions have been proposed as a language-level replacement for locks, there is growing need for well-defined semantics. In contrast to database transactions, transaction memory (TM) semantics are compli...
详细信息
ISBN:
(纸本)9781595939739
As memory transactions have been proposed as a language-level replacement for locks, there is growing need for well-defined semantics. In contrast to database transactions, transaction memory (TM) semantics are complicated by the fact that programs may access the same memory locations both inside and outside transactions. Strongly atomic semantics, where non-transactional accesses are treated as implicit single-operation transactions, remain difficult to provide without specialized hardware support or significant performance overhead. As an alternative, many in the community have informally proposed that a single global lock semantics [18, 10], where transaction semantics are mapped to those of regions protected by a single global lock, provide an intuitive and efficiently implementable model for programmers. In this paper, we explore the implementation and performance implications of single global lock semantics in a weakly atomic STM from the perspective of Java, and we discuss why even recent STM implementations fall short of these semantics. We describe a new weakly atomic Java STM implementation that provides single global lock semantics while permitting concurrent execution, but we show that this comes at a significant performance cost. We also propose and implement various alternative semantics that loosen single lock requirements while still providing strong guarantees. We compare our new implementations to previous ones, including a strongly atomic STM. [24] Copyright 2008 ACM.
In many real world problems, data sometimes comes from n agents ( n ≥ 2), i.e., “multipolar information” exists. This information cannot be well-represented by means of fuzzy graphs or bipolar fuzzy grap...
详细信息
In many real world problems, data sometimes comes from n agents ( n ≥ 2), i.e., “multipolar information” exists. This information cannot be well-represented by means of fuzzy graphs or bipolar fuzzy graphs. Therefore, m -polar fuzzy set theory is applied to graphs to describe the relationships among several individuals. In this paper, some operations are defined to formulate these graphs. Some properties of strong m -polar fuzzy graphs, self-complementary m -polar fuzzy graphs and self-complementary strong m -polar fuzzy graphs are discussed.
In this paper, we define some results on generalized interval-valued intuitionistic fuzzy sets (GIVIFSs). In fact, all interval-valued intuitionistic fuzzy sets (IVIFSs) are GIVIFSs but all GIVIFSs are not IVIFSs. We ...
详细信息
In the present article, we have considered the issue of selection of potential locations of trade objects as a multi-factor decision-making in the conditions of uncertainty by applying the theory of fuzzy sets. Exampl...
详细信息
The authors present their latest research results and developments of a code generator for Matlab / Simulink block diagrams and to download the generated code onto safety related systems such as a safety PLC (Programm...
详细信息
Simultaneous Localization and Mapping (SLAM) algorithms with multiple autonomous robots have received considerable attention in recent years. In general, SLAM algorithms use odometry information and measurements from ...
详细信息
The subject of the study is methods of balancing raw data. The purpose of the article is to improve the quality of intrusion detection in computer networks by using class balancing methods. Task: to investigate method...
详细信息
暂无评论