Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The main contribution of this work is to present elegant broadcast-efficient algorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (BCM, for short) endod with p processors and k communication channels.  begin by presenting an optimal off-line routing algorithm using n/k broadcast rounds for any k, p, and n.  then go on to develop an on-line routing algorithm that takes 2 n/k+k-1 broadcast rounds on a p-processor, k-channel BCM, whenever k/spl les//spl radic/(p/2). Using this routing algorithm,  develop a ranking algorithm that takes only 3 n/k+0(n/k) broadcast rounds, as ll as a sorting algorithm that takes 4 n/k+0(n/k) broadcast rounds on a p-processor, k-channel BCM, provided that k/spl les//spl radic/(p/2) and p/spl isin/0(n). Our algorithms offer a significant improvement over the state of the art.
['Koji Nakano', 'Stephan Olariu', 'James L. Schwing']
I am writing a research paper on a idea Broadcast-efficient algorithms on the coarse-grain broadcast communication model with few channels
[{"from": "human", "value": "I am writing a research paper on a idea Broadcast-efficient algorithms on the coarse-grain broadcast communication model with few channels"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The main contribution of this work is to present elegant broadcast-efficient algorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (BCM, for short) endod with p processors and k communication channels.  begin by presenting an optimal off-line routing algorithm using n/k broadcast rounds for any k, p, and n.  then go on to develop an on-line routing algorithm that takes 2 n/k+k-1 broadcast rounds on a p-processor, k-channel BCM, whenever k/spl les//spl radic/(p/2). Using this routing algorithm,  develop a ranking algorithm that takes only 3 n/k+0(n/k) broadcast rounds, as ll as a sorting algorithm that takes 4 n/k+0(n/k) broadcast rounds on a p-processor, k-channel BCM, provided that k/spl les//spl radic/(p/2) and p/spl isin/0(n). Our algorithms offer a significant improvement over the state of the art."}]