3,810 resources related to Distributed algorithms
- Topics related to Distributed algorithms
- IEEE Organizations related to Distributed algorithms
- Conferences related to Distributed algorithms
- Periodicals related to Distributed algorithms
- Most published Xplore authors for Distributed algorithms
ICC 2021 - IEEE International Conference on Communications
IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.
The CDC is the premier conference dedicated to the advancement of the theory and practice of systems and control. The CDC annually brings together an international community of researchers and practitioners in the field of automatic control to discuss new research results, perspectives on future developments, and innovative applications relevant to decision making, automatic control, and related areas.
The Annual IEEE PES General Meeting will bring together over 2900 attendees for technical sessions, administrative sessions, super sessions, poster sessions, student programs, awards ceremonies, committee meetings, tutorials and more
IEEE Global Communications Conference (GLOBECOM) is one of the IEEE Communications Society’s two flagship conferences dedicated to driving innovation in nearly every aspect of communications. Each year, more than 2,900 scientific researchers and their management submit proposals for program sessions to be held at the annual conference. After extensive peer review, the best of the proposals are selected for the conference program, which includes technical papers, tutorials, workshops and industry sessions designed specifically to advance technologies, systems and infrastructure that are continuing to reshape the world and provide all users with access to an unprecedented spectrum of high-speed, seamless and cost-effective global telecommunications services.
The ICASSP meeting is the world's largest and most comprehensive technical conference focused on signal processing and its applications. The conference will feature world-class speakers, tutorials, exhibits, and over 50 lecture and poster sessions.
The theory, design and application of Control Systems. It shall encompass components, and the integration of these components, as are necessary for the construction of such systems. The word `systems' as used herein shall be interpreted to include physical, biological, organizational and other entities and combinations thereof, which can be represented through a mathematical symbolism. The Field of Interest: shall ...
The IEEE Transactions on Automation Sciences and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. We welcome results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, ...
Broadcast technology, including devices, equipment, techniques, and systems related to broadcast technology, including the production, distribution, transmission, and propagation aspects.
Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)
IEEE Computer Graphics and Applications (CG&A) bridges the theory and practice of computer graphics. From specific algorithms to full system implementations, CG&A offers a strong combination of peer-reviewed feature articles and refereed departments, including news and product announcements. Special Applications sidebars relate research stories to commercial development. Cover stories focus on creative applications of the technology by an artist or ...
MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications, 1982
We consider a distributed algorithm for dynamically adjusting the input rate of each session of a voice or data network so as to exercise flow control. The algorithm receives periodically information regarding the level of congestion along each session path and iteratively corrects the session input rate. In this paper we place emphasis on voice networks but the ideas involved ...
Proceedings International Phoenix Conference on Computers and Communications, 1995
This paper describes two protocols applicable to directed acrylic graph topologies. The first is a topological sorting of the successor list at each node, and the second is a shortest routing path protocol. Both of these protocols are resilient to transient failures in that they guarantee system recovery in a finite number of moves. This resiliency is obtained by using ...
TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region, 2003
In this paper, a framework for transmission of multicast layer via a packet- pair mechanism is proposed. The performance of PLM using CSFQ queueing mechanism has been evaluated through simulation and showed that PLM/CSFQ exhibits reasonable losses in several experiments. However one of the limitations of the new model is the ability to scale to a large number of PLM ...
2007 IEEE International Conference on Automation and Logistics, 2007
In order to reduce the energy consumption and improve the accuracy of location in Wireless Sensor Networks (WSNs), two distributed location algorithms are proposed in this paper. One is a distributed algorithm based on hops (DABoH). It carries out location through sending the flood message packets initiatively to acquire the information of coordinates of anchor nodes. The other is a ...
2009 Second International Symposium on Electronic Commerce and Security, 2009
Wireless ad-hoc sensor networks have been used widely in the physical world. One of the fundamental problems in sensor networks is the coverage in some complicated situation. In this paper, we studied the breach path problem for target in sensor networks with blind area, and defined the blind area of polygon in sensor networks. The existence of breach path and ...
Bias in the Age of the Algorithm | IEEE TechEthics Virtual Panel
IMS MicroApps: AWR's iFilter
APEC Speaker Highlights: Ron Van Dell
IMS 2012 Microapps - Custom OFDM Validation of Wireless/Military DSP Algorithms and RF Components Daren McClearnon, Jin-Biao Xu, Agilent EEsof
Cultural Algorithms: Harnessing the Power of Social Intelligence 1
Julian Togelius: Algorithms That Play & Design Games
Optimization Algorithms for Signal Processing
Cultural Algorithms: Harnessing the Power of Social Intelligence 2
Honors 2020: Cynthia Dwork Wins the IEEE Richard W. Hamming Medal
A Roboticist, Ethicist and Novelist Walk Into a Bar: IEEE TechEthics Panel at SXSW
Comparing Partitions from Clustering Algorithms
IEEE Day Future Milestones: 100% Renewable Energy penetration Is Possible
Life Through the Eyes of a Machine
Yahoo's Raghu Ramakrishnan Discusses CAP and Cloud Data Management
Eva Tardos - IEEE John von Neumann Medal, 2019 IEEE Honors Ceremony
Some Thoughts on a Gap Between Theory and Practice of Evolutionary Algorithms - WCCI 2012
Spiking Network Algorithms for Scientific Computing - William Severa: 2016 International Conference on Rebooting Computing
The Convergence of OT and IT, the Next Digital Wave - 2018 IEEE Industry Summit on the Future of Computing
The Fundamentals of Compressive Sensing, Part III: Sparse Signal Recovery
We consider a distributed algorithm for dynamically adjusting the input rate of each session of a voice or data network so as to exercise flow control. The algorithm receives periodically information regarding the level of congestion along each session path and iteratively corrects the session input rate. In this paper we place emphasis on voice networks but the ideas involved can also be used for dynamic routing and flow control in data networks.
This paper describes two protocols applicable to directed acrylic graph topologies. The first is a topological sorting of the successor list at each node, and the second is a shortest routing path protocol. Both of these protocols are resilient to transient failures in that they guarantee system recovery in a finite number of moves. This resiliency is obtained by using the notion of self-stabilization. This is a method by which convergence to the desired behavior is guaranteed. These algorithms have direct application in network routing.<<ETX>>
In this paper, a framework for transmission of multicast layer via a packet- pair mechanism is proposed. The performance of PLM using CSFQ queueing mechanism has been evaluated through simulation and showed that PLM/CSFQ exhibits reasonable losses in several experiments. However one of the limitations of the new model is the ability to scale to a large number of PLM sessions, which results in further packet losses experienced by each receiver as more sessions are introduced into the network. The cause is the insufficient reduction of the number of layers per receiver in times of heavy congestion. This is due to the nature of the PLM protocol and the packet mechanism. Overall result from experiments shows that PLM/CSFQ was able to adapt to a network of heterogeneous receivers and it also scales well with the number of receivers that join the same session.
In order to reduce the energy consumption and improve the accuracy of location in Wireless Sensor Networks (WSNs), two distributed location algorithms are proposed in this paper. One is a distributed algorithm based on hops (DABoH). It carries out location through sending the flood message packets initiatively to acquire the information of coordinates of anchor nodes. The other is a distributed algorithm based on angle-vector (DABoAV). It carries out location through introducing the angle of entering signal and applying the triangle cosine theorem. The former has the characteristic of less flood message packets and is applicable of a rigid energy consumption network. The latter has the characteristic of low location errors and is applicable of a network requiring high location accuracy. Simulation experiments validate the correctness and the feasibility of the algorithms. In the simulation, it is shown that the DABoAV owns higher location accuracy just as the anchor nodes density comes up to 10%. DABoH also shows a trend of higher location accuracy quickly with the increasing of anchor nodes. The characteristic of low energy consumption is shown when the two distributed location algorithms work in simulation.
Wireless ad-hoc sensor networks have been used widely in the physical world. One of the fundamental problems in sensor networks is the coverage in some complicated situation. In this paper, we studied the breach path problem for target in sensor networks with blind area, and defined the blind area of polygon in sensor networks. The existence of breach path and definition of maximal break path were also discussed in this paper. Considering the geometric model of sensor networks, we proposed the distributed algorithm to calculate the maximal breach path based on Clifford geometric algebra in sensor networks with blind area. The experimental results and their analyses prove the efficiency of our theory.
A proof system suitable for the mechanical verification of concurrent programs is described. This proof system is based on Unity, and may be used to specify and verify both safety and liveness properties. However, it is defined with respect to an operational semantics of the transition system model of concurrency. Proof rules are simply theorems of this operational semantics. This methodology makes a clear distinction between the theorems in the proof system and the logical inference rules and syntax which define the underlying logic. Since this proof system essentially encodes Unity in another sound logic, and this encoding has been mechanically verified, this encoding proves the soundness of this formalization of Unity. This proof system has been mechanically verified by the Boyer-Moore prover. This proof system has been used to mechanically verify the correctness of a distributed algorithm that computes the minimum node value in a tree.<<ETX>>
The opportunistic spectrum access (OSA) algorithms aim to maximize network throughput by ensuring orthogonal channel allocation among secondary users (SUs) in cognitive radio network (CRN). OSA is challenging in the decentralized CRN due to lack of coordination among SUs. Most of the existing algorithms assume prior knowledge of the number of active SUs to guarantee orthogonalization. In addition, they assume static network only where all SUs stay in the network throughout the horizon which is not feasible in practical conditions. However the dynamic network may also exist where the SUs can enter or exit the network at any time. Also, most of the existing algorithms assume an i.i.d. reward model whereas a markovian model may be more appropriate where the rewards are assumed to come from a finite, irreducible and aperiodic Markov chain represented by a single parameter probability transition matrix. Thus, our goal is to design a distributed algorithm for decentralized static and dynamic network without prior knowledge of the number of active SUs with i.i.d. as well as markovian reward model.
The SMP cluster becomes more and more important in high performance computing and speedup is the main performance criterion of parallel and distributed algorithms. But the traditional definition of speedup is not fit for the SMP cluster architecture. How can we measure speedup of the SMP cluster? We analyze the nonequivalence of n-processor sets in the SMP cluster based on the introduction to traditional and node-oriented speedup definitions, propose a corresponding speedup definition, optimal-processor-set speedup, in both theoretical and practical views, and illustrate its benefits by an example executing on two SMP clusters.
In many network applications, the computation takes place on the minimum-cost spanning tree (MST) of the network G; unfortunately, a single link or node failure disconnects the tree. The ALL NODES REPLACEMENT (ANR) problem is the problem of precomputing, for each node u in G, the new MST should u fail. This problem has been extensively investigated for serial and parallel settings, and efficient solutions have been designed for those environments. The situation is surprisingly different in distributed settings. In fact, no distributed solution exists to date which performs better than the brute-force repeated application of MST construction. In this paper, we consider for the first time the problem of computing all the replacement minimum-cost spanning trees distributively. We design a solution protocol, and we prove that the total amount of communication exchanges taking place is O(n), each exchange using at most O(n) data items. Hence, the total amount of data items communicated during the computation (the data complexity) is O(n^2). We also show how the simpler problem ALL EDGES REPLACEMENT (AER) dealing with single edge failures, which can be solved with the same costs using some existing techniques. Also for the AER problem, efficient solutions exist in the serial and parallel setting but, prior to this work, no distributed solution other than brute force was known.
No standards are currently tagged "Distributed algorithms"