4,112 resources related to Message passing
- Topics related to Message passing
- IEEE Organizations related to Message passing
- Conferences related to Message passing
- Periodicals related to Message passing
- Most published Xplore authors for Message passing
2020 IEEE International Symposium on Antennas and Propagation and North American Radio Science Meeting
The joint meeting is intended to provide an international forum for the exchange of information on state of the art research in the area of antennas and propagation, electromagnetic engineering and radio science
2020 IEEE 17th International Symposium on Biomedical Imaging (ISBI 2020)
The IEEE International Symposium on Biomedical Imaging (ISBI) is the premier forum for the presentation of technological advances in theoretical and applied biomedical imaging. ISBI 2020 will be the 17th meeting in this series. The previous meetings have played a leading role in facilitating interaction between researchers in medical and biological imaging. The 2020 meeting will continue this tradition of fostering cross-fertilization among different imaging communities and contributing to an integrative approach to biomedical imaging across all scales of observation.
2020 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
CVPR is the premier annual computer vision event comprising the main conference and several co-located workshops and short courses. With its high quality and low cost, it provides an exceptional value for students, academics and industry researchers.
The International Conference on Consumer Electronics (ICCE) is soliciting technical papersfor oral and poster presentation at ICCE 2018. ICCE has a strong conference history coupledwith a tradition of attracting leading authors and delegates from around the world.Papers reporting new developments in all areas of consumer electronics are invited. Topics around the major theme will be the content ofspecial sessions and tutorials.
The International Conference on Image Processing (ICIP), sponsored by the IEEE SignalProcessing Society, is the premier forum for the presentation of technological advances andresearch results in the fields of theoretical, experimental, and applied image and videoprocessing. ICIP 2020, the 27th in the series that has been held annually since 1994, bringstogether leading engineers and scientists in image and video processing from around the world.
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.)
Telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation, including radio; wire; aerial, underground, coaxial, and submarine cables; waveguides, communication satellites, and lasers; in marine, aeronautical, space and fixed station services; repeaters, radio relaying, signal storage, and regeneration; telecommunication error detection and correction; multiplexing and carrier techniques; communication switching systems; data communications; and communication theory. In addition to the above, ...
Computer, the flagship publication of the IEEE Computer Society, publishes peer-reviewed technical content that covers all aspects of computer science, computer engineering, technology, and applications. Computer is a resource that practitioners, researchers, and managers can rely on to provide timely information about current research developments, trends, best practices, and changes in the profession.
Methods, algorithms, and human-machine interfaces for physical and logical design, including: planning, synthesis, partitioning, modeling, simulation, layout, verification, testing, and documentation of integrated-circuit and systems designs of all complexities. Practical applications of aids resulting in producible analog, digital, optical, or microwave integrated circuits are emphasized.
Design and analysis of algorithms, computer systems, and digital networks; methods for specifying, measuring, and modeling the performance of computers and computer systems; design of computer components, such as arithmetic units, data storage devices, and interface devices; design of reliable and testable digital devices and systems; computer networks and distributed computer systems; new computer organizations and architectures; applications of VLSI ...
Mobile Agents in Networking and Distributed Computing, None
Proceedings Third International Workshop on High-Level Parallel Programming Models and Supportive Environments, 1998
Distributed shared memory (DSM) is a paradigm for programming distributed systems, which provides an alternative to the message passing model. DSM offers the agents of the system a shared address space through which they can communicate with each other. The main problem of a DSM implementation on top of a message passing system is performance. Performance of an implementation is ...
Proceedings of the 5th Biannual World Automation Congress, 2002
In this paper, we compare two modified versions of Yokoo's (2001) distributed breakout hill-climbing algorithm (DBA), mDBA-I and mDBA-II, along with six evolutionary computations referred to as societies of hill-climbers (SoHC) on 400 randomly generated distributed constraint satisfaction problems. Each SoHC is composed of S instances of mDBA-II running in parallel, where S represents the society size. The S hill-climbers ...
Proceedings Scalable Parallel Libraries Conference, 1994
The Message Passing Interface (MPI), as an effort to unify message passing systems to achieve portability, defines a widely used standard for writing message passing programs. But MPI alone operates on a rather system-oriented level and does not provide higher abstractions that are mandatory when developing large scale message passing applications. As a result, a programming environment is necessary that ...
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 ...
A Message from IEEE WIE Chair, Dr. Lisa Lazareck-Asunta
Message from IEEE President Ray
Message from IEEE President-Elect Kam
IMS Organizer: JK McKinney , General Chairman for IMS 2010 on Exhibitors
Changing the world: IEEE Women in Engineering (WIE)
Dejan S. Milojicic - Meet the 2019 IEEE Presidential Candidates
Business Dialogue - Internet Inclusion: Global Connect Stakeholders Advancing Solutions, Washington DC, 2016
Q&A with Dr. K. J. Ray Liu: IEEE Big Data Podcast, Episode 11
Susan K. “Kathy” Land - Meet the 2019 IEEE Presidential Candidates
ICASSP 2010 - Radar Imaging of Building Interiors
Helping Your Members Building Writing and Presentation Skills - Ryan Boettger - Sections Congress 2017
Superconducting MAGLEV in Japan - ASC-2014 Plenary series - 13 of 13 - Friday 2014/8/15
Distributed shared memory (DSM) is a paradigm for programming distributed systems, which provides an alternative to the message passing model. DSM offers the agents of the system a shared address space through which they can communicate with each other. The main problem of a DSM implementation on top of a message passing system is performance. Performance of an implementation is closely related to the consistency the DSM system offers: strong consistency (all agents agree about how memory events happen) and is more expensive to implement than weak consistency (disagreements are allowed). There have been many DSM systems proposals, each one supporting different consistency levels. Experience has shown that no one is well suited for the whole range of problems. In some cases, strong consistent primitives are not needed, while in other cases, the weak semantics provided are useless. This is also true for different implementations of the same memory model, since performance is also affected by the data access patterns of the applications. We introduce a novel DSM model called Mume. Mume is a low level layer close to the level of the message passing interface. The Mume interface provides only the minimum requirements to be considered as a shared memory system. The interface includes three types of synchronization primitives, namely total ordering, causal ordering and mutual exclusion. This allows efficient implementations of different memory access semantics, accommodating particular data access patterns.
In this paper, we compare two modified versions of Yokoo's (2001) distributed breakout hill-climbing algorithm (DBA), mDBA-I and mDBA-II, along with six evolutionary computations referred to as societies of hill-climbers (SoHC) on 400 randomly generated distributed constraint satisfaction problems. Each SoHC is composed of S instances of mDBA-II running in parallel, where S represents the society size. The S hill-climbers communicate with one another through a distributed list of breakout elements which represent nogoods discovered at local minima. Our results show that larger society sizes are better in terms of convergence percentage and average cycle performance. However, this better performance comes at a cost of increased constraint checks and message sizes.
The Message Passing Interface (MPI), as an effort to unify message passing systems to achieve portability, defines a widely used standard for writing message passing programs. But MPI alone operates on a rather system-oriented level and does not provide higher abstractions that are mandatory when developing large scale message passing applications. As a result, a programming environment is necessary that not only addresses MPI but also provides programmer oriented abstractions for the core problems of parallel programs, i.e. the management of process, data and communication. We present our on-going approach-PEMPI, an integrated programming environment based on MPI, in which a programmer can obtain portability by employing the MPI standard; achieve performance through machine best-fit implementation; and increase programmability by exploiting higher abstractions based on the Basel Algorithm Classification Scheme (BACS).<<ETX>>
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>>
Recently, a novel algorithm for low complexity, iterative MIMO detection has been devised based on pair-wise Markov random fields (MRF) in , where for two types of MRF, namely, the fully-connected and the ring-type MRF, they developed belief propagation based iterative algorithm run over the corresponding factor graphs. Since the factor graphs have only 2 edges per factor node, the computations are much easier than that of ML. In this paper, we further simplify the algorithm by making hard-decision in intermediate message passing. By doing so, the complexity can be further reduced at only a small performance degradation.
PDF (Portable Document Format) documents have become popular in recent times. PDF documents have named destinations that have reference to info like page number, zoom level, scale factor etc. These named destinations should be resolved when user loads URL with named destination or select link in the PDF. Resolving named destinations in PDF is taking more time that affects response time in PDF after user selection or resolving named destination at the URL load time for rendering PDF in Chrome Browser. In this paper, we present a new dictionary based novel solution for improving time to resolve named destinations. Dictionary is the map of named destinations and corresponding page number in the PDF document. We then present the results of some tests on the purposed approach with the already existing approach to show that the purposed approach performs better compared to existing approach while creation of named destinations dictionary does not take significant time. We conclude that our algorithm can perform better as asynchronous message passing is avoided and we have access to page number corresponding to the named destination in constant time and in synchronous manner.
For serial computation, the object-oriented methodology (O-O) has been shown to aid program modeling increase reusability, and result in more robust programs. Because of its object-centricity, O-O seems well suited to data parallel models of massively parallel programming. Many of the benefits of O-O stem from the arbitrary combining of objects, and the resulting arbitrary message passing patterns. Unfortunately, when working with tens of thousands of processors in parallel, this arbitrariness can result in communication conflicts. The paper proposes a model of objects and communication that resolves this problem.<<ETX>>
The Message Passing Interface I.I (MPI I.I) standard defines a library of message-passing functions for parallel and distributed computing. We have developed a new software tool called C++2MPI which can automatically generate MPI derived datatypes for a specified C++ class. C++2MPI can generate data types for derived classes, for partially and fully-specialized templated classes, and for classes with private data members. Given one or more user- provided classes as input, C++2MPI generates, compiles and archives a function for creating the MPI derived datatype. When the generated function is executed, it builds the derived MPI datatype if the datatype does not already exist, and returns the value of an MPI handle for referencing the datatype. PGMT (Processing Graph Method Tool) is a set of application program interfaces for porting the Processing Graph Method (PGM), a parallel programming method, to diverse networks of processors. C++2MPI was developed as a component of PGMT, but can be used as a stand-alone tool.
The project defines a standard for high-speed (>100 Mbps at the physical layer) communication devices via electric power lines, so-called broadband over power line (BPL) devices. This standard uses transmission frequencies below 100 MHz. It is usable by all classes of BPL devices, including BPL devices used for the first-mile/last-mile connection (<1500 m to the premise) to broadband services as ...
This document is part of the POSIX series of standards for applications and user interfaces to open systems. It defines the Ada language bindings as package specifications and accompanying textual descriptions of the applications program interface (API). This standard supports application portability at the source code level through the binding between ISO 8652:1995 (Ada) and ISO/IEC 9945-1:1990 (IEEE Std 1003.1-1990 ...