Jean Frédéric Myoupo

article

A fast sequential algorithm for the matrix chain ordering problem

Jerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frédéric Myoupo

Concurrency and Computation: Practice and Experience > 33 > 24 > n/a - n/a

This article presents a fast sequential algorithm for the matrix chain ordering problem. Our solution is based on Yao's sequential algorithm that solves this problem in

𝒪 (n^{2})

time by reducing the total number of distinct subproblems to be performed. We solve them fastly by avoiding some unnecessary computations. Our strategy consists in organizing the evaluation of the subproblems according to their...

article

Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints

Vianney Kengne Tchendji, Armel Nkonjoh Ngomade, Jerry Lacmou Zeutouo, Jean Frédéric Myoupo

Parallel Computing > 2020 > 91 > C

A variant of the Longest Common Subsequence (LCS) problem is the LCS problem with multiple substring-exclusion constraints (M-STR-EC-LCS), which has great importance in many fields especially in bioinformatics. This problem consists to compute the LCS of two strings X and Y of length n and m respectively that excluded a set of d constraints P={P1,P2,…,Pd} of total length r. Recently, Wang et al. proposed...

article

Conflict-free rerouting scheme through flow splitting for virtual networks using switches

Vianney Kengne Tchendji, Yannick Florian Yankam, Jean Frédéric Myoupo

Journal of Internet Services and Applications > 2018 > 9 > 1 > 1-15

The weaknesses of the Internet led to the creation of a new network paradigm – network virtualization. Virtualization is a very successful technique for sharing and reusing resources, which results in higher efficiency. Despite its advantages, including flexibility in network architecture, virtualization imposes many challenges, such as physical resource allocation to virtual devices. An efficient...

chapter

A Fault-Tolerant Permutation Routing Algorithm in Mobile Ad-Hoc Networks

Djibo Karimou, Jean Frédéric Myoupo

Lecture Notes in Computer Science > Networking - ICN 2005 > Ad Hoc Networks (I) > 107-115

Mobile ad-hoc networks (MANET) is a distributed systems formed by wireless mobiles nodes, that can dynamically self organize into arbitrary and temporary networks with no pre-existing communication infrastructure. After initialization, one of a crucial issue in ad-hoc network, is how to transmit items held by the stations to their destinations called Permutation Routing. As mobiles devises are dependant...

chapter

Designing modular linear systolic arrays using dependence graph regular partitions

Jean-Frédéric Myoupo, Anne-Cécile Fabret

Lecture Notes in Computer Science > Parallel Processing: CONPAR 92—VAPP V > 265-270

In this paper, we use a variant of the geometric method to derive efficient modular linear systolic algorithms for the transitive closure and shortest path problems. Furthermore, we show that partially-pipelined modular linear systolic algorithms with an output operation, for matrix multiplication, can be as efficient as fully-pipelined ones, and in some cases needs less cells.

chapter

A Non-Token-Based-Distributed Mutual Exclusion Algorithm for Single-Hop Mobile Ad Hoc Networks

Romain Mellier, Jean-Frederic Myoupo, Vlady Ravelomanana

IFIP — The International Federation for Information Processing > Mobile and Wireless Communication Networks > 287-298

This paper presents a simple mutual exclusion algorithm for ad hoc mobile networks. Our algorithm does not use the token circulation technique. A station which requests a Critical Section (CS) competes in order to be alone to use the unique channel dedicated to this CS. To reach this goal, we derive a Markov process which guarantees that each station will enter the CS. More precisely, we show that,...

chapter

A fully-pipelined solutions constructor for dynamic programming problems

Jean Frédéric Myoupo

Lecture Notes in Computer Science > Advances in Computing and Information — ICCI '91 > 421-430

The problem of designing modular linear systolic arrays for dynamic programming was raised in [9]. An attempt to solve this problem appeared in [8]. Unfortunately, the size of the local memory of each processor and the time delay between two consecutive processors of this array (in [8]) are still depending on n as in [9]. Moreover, these two arrays (in [8, 9]) are partially pipelined. Some elements...

chapter

Collision-Free Routing Protocol in Multi-hop Wireless Sensor Networks

Hicham Lakhlef, Julien Bourgeois, Saad Harous, Jean Frederic Myoupo

2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing > 92 - 99

2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing (CIT/IUCC/DASC/PICOM)

Wireless sensor network (WSN) consists of a large number of low-power, limited-processing capability, MEMS (Micro-Electromechanically Systems) capable of measuring and reporting physical variables related to their environment. WSN (p,n) is a wireless sensor network of p sensors with n items (information) distributed on it. The aim of the permutation routing is to route to each sensor, its n/p items...

chapter

Cliques and clusters based hierarchical scheme for sensor networks partitioning

Hicham Lakhlef, Abdelhak Bentaleb, Jean-Frederic Myoupo, Abdelhak Boubetra, more

2013 7th IEEE GCC Conference and Exhibition (GCC) > 355 - 360

2013 7th IEEE GCC Conference and Exhibition (GCC)

The hierarchical clustering for wireless sensors networks is treated to solve the scalability problem in routing protocols for multi-hop wireless networks. Also a clustering-based technique is proposed to provide location management of devices for QoS support. To the best of our knowledge there is no protocol that combines the hierarchical partitioning into clusters and cliques taking into account...

article

An efficient coarse-grain multicomputer algorithm for the minimum cost parenthesizing problem

Vianney Kengne Tchendji, Jean Frédéric Myoupo

The Journal of Supercomputing > 2012 > 61 > 3 > 463-480

Several problems modeled by dynamic programming have been solved using a coarse-grain multicomputer parallel model (CGM for short). These problems use either polyadic dynamic programming or monadic non-serial dynamic programming. In this paper, we address the general case: we propose a parallel algorithm in the CGM model with p processors for the Optimal String Parenthesizing Problem or Minimum Cost...

article

A randomized clustering of anonymous wireless ad hoc networks with an application to the initialization problem

Jean Frédéric Myoupo, Aboubecrine Ould Cheikhna, Idrissa Sow

The Journal of Supercomputing > 2010 > 52 > 2 > 135-148

The Distributed Mobility-Adaptive Clustering (DMAC) due to Basagni partitions the nodes of a mobile ad hoc network into clusters, thus giving the network a hierarchical organization. This algorithm supports the mobility of the nodes, even during the cluster formation. The main feature of DMAC is that in a weighted network (in which two or more nodes cannot have the same weight), nodes have to choose...

chapter

GPS-Free Geocasting Algorithms in Mobile Ad hoc Networks

Romain Mellier, Jean Frederic Myoupo, Idrissa Sow

2006 International Conference on Wireless and Mobile Communications > 38

2006 International Conference on Wireless and Mobile Communications

Ad hoc network is a collection of a large number of wireless devices capable to move in an unspecified geographical area. In this paper it is a question of the geocasting which is an alternative of the multicasting problem in mobile ad hoc networks. We suggest two algorithms of geocasting in which the nodes are located without GPS. After their deployment, nodes execute a distributed algorithm of localization...

chapter

AWeighted Clustering Algorithm For Mobile Ad Hoc NetworksWith Non Unique Weights

Romain Mellier, Jean-Frederic Myoupo

2006 International Conference on Wireless and Mobile Communications > 39

2006 International Conference on Wireless and Mobile Communications

In 1999, S. Basagni has presented the DMAC algorithm (Distributed Mobility-Adaptive Clutering) that partitions the nodes of a mobile ad hoc network into clusters, thus giving the network a hierarchical organization. This algorithm supports the mobility of the nodes, even during the cluster formation. Its main feature is that it considers weighted networks to choose the clusterheads, in contrary to...

article

Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory

Jean-Frédéric Myoupo, David Semé

The Journal of Supercomputing > 2006 > 38 > 1 > 83-107

This paper presents BSR-parallel algorithms for some problems in fundamental graph theory : transitive closure, connected components, spanning tree, bridges and articulation points of a graph and bipartite graph recognition. There already exist constant time algorithms to solve these problems on a mesh with reconfigurable bus system using O(N ⁴) processors. Here we show that these problems...

article

An Application of an Initialization Protocol to Permutation Routing in a Single-Hop Mobile Ad Hoc Networks

Djibo Karimou, Jean Frédéric Myoupo

The Journal of Supercomputing > 2005 > 31 > 3 > 215-226

In 1999 Nakano, Olariu, and Schwing in [20], they showed that the permutation routing of n items pretitled on a mobile ad hoc network (MANET for short) of p stations (p known) and k channels (MANET{(n, p, k)) with k < p, can be carried out in $\frac{2n}{k} + k - 1$ broadcast rounds if k ≤ √p and if each station has a $O(\frac{n}{k})$ -memory locations. And if k ≤ $\smash{\sqrt{\frac {p} {2}}}$ ...

article

Optimal BSR Solutions to Several Convex Polygon Problems

Jean-Frédéric Myoupo, David Semé, Ivan Stojmenovic

The Journal of Supercomputing > 2002 > 21 > 1 > 77-90

This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time solutions on a linear number, max(N, M) (where N and M are the number of edges of the two considered polygons), of processors for computing the maximum distance between two convex polygons, finding critical support lines of two convex polygons,...

article

Improved linear systolic algorithms for substring statistics

Jean-Frédéric Myoupo, Ahmad Wabbi

Information Processing Letters > 1997 > 61 > 5 > 253-258

Improved linear and square systolic arrays are presented that support the detection of repetitions in a string and the substring statistics with and without overlap. The time equals to 5n/4 - 1 and n for the first and the second problems respectively, where n is the length of the string, whereas the number of processors is, respectively, n/4 andn ² /2.

article

A faster linear systolic algorithm for recovering a longest common subsequence

Thierry Lecroq, Guillaume Luce, Jean Frédéric Myoupo

Information Processing Letters > 1997 > 61 > 3 > 129-136

We present a new linear systolic array architecture of m cells which outputs a longest common subsequence (LCS) of two input strings A and B in time n + 2m, where n and m denote the lengths of A andB respectively (m n). Our approach improves the time of execution required by previous linear systolic arrays for this purpose. Furthermore, a design combining a tree with the linear array provides...

INFONA - science communication portal

Search results for: Jean Frédéric Myoupo

A fast sequential algorithm for the matrix chain ordering problem

Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints

Conflict-free rerouting scheme through flow splitting for virtual networks using switches

A Fault-Tolerant Permutation Routing Algorithm in Mobile Ad-Hoc Networks

Designing modular linear systolic arrays using dependence graph regular partitions

A Non-Token-Based-Distributed Mutual Exclusion Algorithm for Single-Hop Mobile Ad Hoc Networks

A fully-pipelined solutions constructor for dynamic programming problems

Collision-Free Routing Protocol in Multi-hop Wireless Sensor Networks

Cliques and clusters based hierarchical scheme for sensor networks partitioning

An efficient coarse-grain multicomputer algorithm for the minimum cost parenthesizing problem

A randomized clustering of anonymous wireless ad hoc networks with an application to the initialization problem

GPS-Free Geocasting Algorithms in Mobile Ad hoc Networks

AWeighted Clustering Algorithm For Mobile Ad Hoc NetworksWith Non Unique Weights

Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory

An Application of an Initialization Protocol to Permutation Routing in a Single-Hop Mobile Ad Hoc Networks

Optimal BSR Solutions to Several Convex Polygon Problems

Improved linear systolic algorithms for substring statistics

A faster linear systolic algorithm for recovering a longest common subsequence

Filter options

Publication date

Content availability

Publication type

Keywords

Data set

Journal

INFONA - science communication portal

Search results for: Jean Frédéric Myoupo

Add recipient

Sending message cancelled

Are you sure you want to cancel sending this message?

Send message

Filter options

Publication date

Date range setting

Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.

Content availability

Publication type

Keywords

Data set

Journal

Reporting an error / abuse

Sending the report failed

Accessibility options