Graph Community Detection Algorithm for Distributed Memory Parallel Computing...Alexander Pozdneev
Community detection is an important problem that spans many research areas, such as social networks, systems biology, power grid optimization. The fine-grained communication and irregular access pattern to memory and interconnect limit the overall scalability and performance of existing algorithms. This talk presents a highly scalable parallel algorithm for distributed memory systems. The method employs a novel implementation strategy to store and process dynamic graphs. The scalability analysis of the algorithm was performed using two massively parallel machines, Blue Gene/Q and Power7-IH, for graphs with up to hundreds of billions of edges. Leveraging the convergence properties of the algorithm and the efficient implementation, it is possible to analyze communities of large-scale graphs in just a few seconds. The talk is based on a paper accepted for publication in IPDPS-2015 conference proceedings that was kindly provided by Dr. Fabrizio Petrini (IBM Research).
Solving QoS multicast routing problem using ACO algorithmAbdullaziz Tagawy
Many Internet multicast applications have stringent Quality-of-Service (QoS) requirements that include delay, loss rate, bandwidth, and delay jitter. In this paper, we present a Swarm intelligence based on Ant Colony Optimization (ACO) technique to optimize the multicast tree
Graph Community Detection Algorithm for Distributed Memory Parallel Computing...Alexander Pozdneev
Community detection is an important problem that spans many research areas, such as social networks, systems biology, power grid optimization. The fine-grained communication and irregular access pattern to memory and interconnect limit the overall scalability and performance of existing algorithms. This talk presents a highly scalable parallel algorithm for distributed memory systems. The method employs a novel implementation strategy to store and process dynamic graphs. The scalability analysis of the algorithm was performed using two massively parallel machines, Blue Gene/Q and Power7-IH, for graphs with up to hundreds of billions of edges. Leveraging the convergence properties of the algorithm and the efficient implementation, it is possible to analyze communities of large-scale graphs in just a few seconds. The talk is based on a paper accepted for publication in IPDPS-2015 conference proceedings that was kindly provided by Dr. Fabrizio Petrini (IBM Research).
Solving QoS multicast routing problem using ACO algorithmAbdullaziz Tagawy
Many Internet multicast applications have stringent Quality-of-Service (QoS) requirements that include delay, loss rate, bandwidth, and delay jitter. In this paper, we present a Swarm intelligence based on Ant Colony Optimization (ACO) technique to optimize the multicast tree
Solving QoS multicast routing problem using aco algorithm Abdullaziz Tagawy
In IP multicasting messages are sent from the source node to all destination nodes. In order to meet QoS requirements an optimizing algorithm is needed. We propose an Ant Colony Optimization algorithm to do so. Ants release a chemical called pheromone while searching for food. They are capable of finding shortest path to their target. This can give an effective optimal solution to our Multicast Routing Problem.
La esencia del gobierno abierto está muy relacionada con la de acceso a la información, porque abrir un gobierno es poner a disposición de todos los datos de su gestión. El Gobierno abierto se puede definir como aquel que sitúa al ciudadano en el eje central de sus políticas, empoderándolo y coordinándose con él mediante una comunicación bidireccional. Sustentado en principios tales como la transparencia o el empleo de las TIC. Convirtiéndose las nuevas tecnologías en el cauce para lograr otros propósitos: transparencia, participación y rendición de cuentas. Pues un gobierno transparente favorece la rendición de cuentas, al poner a disposición del ciudadano la información sobre su gestión. Un gobierno participativo potencia el pensamiento colectivo, a través del que se crearán propuestas para mejorar la labor de la Administración. Y un gobierno colaborativo implica a todos en la tarea de construir un país mejor.
Solving QoS multicast routing problem using aco algorithm Abdullaziz Tagawy
In IP multicasting messages are sent from the source node to all destination nodes. In order to meet QoS requirements an optimizing algorithm is needed. We propose an Ant Colony Optimization algorithm to do so. Ants release a chemical called pheromone while searching for food. They are capable of finding shortest path to their target. This can give an effective optimal solution to our Multicast Routing Problem.
La esencia del gobierno abierto está muy relacionada con la de acceso a la información, porque abrir un gobierno es poner a disposición de todos los datos de su gestión. El Gobierno abierto se puede definir como aquel que sitúa al ciudadano en el eje central de sus políticas, empoderándolo y coordinándose con él mediante una comunicación bidireccional. Sustentado en principios tales como la transparencia o el empleo de las TIC. Convirtiéndose las nuevas tecnologías en el cauce para lograr otros propósitos: transparencia, participación y rendición de cuentas. Pues un gobierno transparente favorece la rendición de cuentas, al poner a disposición del ciudadano la información sobre su gestión. Un gobierno participativo potencia el pensamiento colectivo, a través del que se crearán propuestas para mejorar la labor de la Administración. Y un gobierno colaborativo implica a todos en la tarea de construir un país mejor.