<< 2008-9 >>
Department of
Computer Science
 
Simon Hollis - Research Interests

Simon Hollis

Current Research Interests

Many-core Implementations and Interconnect

Increasingly-many modern I.C. devices use many-core structures to produce high performance designs. However, the integration of hundreds or thousands of processing cores onto a single chip is an extremely demanding challenge. There are issues of power consumption (i.e. to run so many processing elements from a battery, or simply without melting a chip), through interconnection (a fully-interconnected network of thousands of nodes scales terribly), and all the way to implementings algorithms and scheduleres to perform well on such a hugely-parallel device. My focus is on a combination of the energy-efficiency and interconnection problems — multi-core interconnects typically take a large proportion of the power budget of a device, and so increasing their efficiency has the beneficial side-effect of simultaneously reducing energy-consumption.

On-chip Global Interconnect

The problem of distributing data on-chip within a clock period is well known. Both difficult, and power hungry, it is the bane of chip designers everywhere. I am looking at non-conventional ways to address the problem, both from a clock-skew persepective, and a power dissipation one. Some of the techniques involve asynchronous logic, and others are more conventional. To date, I have developed a near-1Gbit/s point-to-point link, using a pulse-based serial format and an ultra low area footprint. There is more information on this on my publications page.

Security Device Defences

I am also interested in research concerning security devices. Examples of which range from commodity smart-cards to ATM security modules. Of particular interest is addressing side-channel attacks; I have worked on circuit-level techniques to alleviate these vunerabilities. The interested reader is invited to visit my publications page for more details.

I also keep a keen interest in processor design and network routing.

© 1995-2009 University of Bristol  |  Terms and Conditions
About this Page