Jason's Computer Science Blog » Hongbing Fan

COCOA 2008 Paper

Jason Ernst — Fri, 15 Aug 2008 20:45:31 +0000

Just a small update, my first conference paper “Algorithms and Implementation for Interconnection Graph Problem” by Hongbing Fan, Christian Hundt, Yu-Liang Wu and myself, will be presented at COCOA 2008 in St. John’s Newfoundland on Friday, August 22nd at 9:40am by Dr. Fan. I am unable to attend since I am quite busy working on my thesis and other work. You can view the program for the rest of the conference at the COCOA website

Customized Reconfigurable Interconnection Network Paper Accepted to COCOA ’08

Jason Ernst — Thu, 01 May 2008 13:38:02 +0000

Yesterday I found out that a paper I helped out with got accepted to COCOA 2008 Conference in St. John’s Newfoundland. This is the first academic paper I have worked on, and also the first one that has been accepted to a conference so I am extremely excited.

The paper is on a greedy reduction algorithm that finds the minimum number of connections required for a set of routing requirements. I have probably mentioned something about it in earlier posts. The algorithm has quite a few applications. My advisor, Dr. Fan plans to use it for designing circuits, networks-on-chip and FPGAs and I have used it in a simulation for wireless networks. I will post the paper sometime after I get the go-ahead from my advisor, which I imagine will be sometime after it has been officially published.

I realize this post is somewhat sort and theres not much to it but theres not much time for posting these days since the advisors are pushing me to decide on a new direction for my thesis within the next couple of days. So back to work for me, yay reading!

Customized Reconfigureable Interconnection Network (CRIN) Paper

Jason Ernst — Sat, 08 Mar 2008 19:02:58 +0000

Recently, I have begun working on a new research project dealing with some graph theory with Dr. Hongbing Fan at Wilfrid Laurier University. As the title suggests the problem works with customized reconfigurable interconnection networks (CRINs). Dr. Fan has proposed an algorithm which attempts to minimize the connections within a network based on a set of routing requirements.

An example Interconnection Graph Problem, Click to Enlarge

Since December of 2007 I have been working at implementing, testing and experimenting the algorithm as well as providing feedback and new ideas for improvements. The paper is almost ready to be submitted for publication this so hopefully I will be able to provide a link to it in the future.

In relation with my thesis, I am planning on making use of the CRIN algorithm to attempt to optimize wireless network protocols. There still needs to be some experimentation and research to determine if in fact the algorithm can be used in this way however I feel optimistic that this is the case.

There is also the potential that the source code for the CRIN implementation may be made open source and released for use by anyone. If this is the case it will be uploaded to this site in the future.