CALENDAR

Abstract:

Multicore platforms are predicted to become significantly larger in the coming years.  Given that real-time workloads will inevitably be deployed on such platforms, the scalability of the scheduling algorithms used to support such workloads warrants investigation.  In this talk, this issue is considered and an empirical evaluation of several global and partitioned scheduling algorithms is presented.  This evaluation was conducted using a Sun Niagara multicore platform with 32 logical CPUs (eight cores, four hardware threads per core).  In this study, global algorithms were found to be have generally better performance than partitioning approaches.

About the speaker:

James H. Anderson is a professor in the Department of Computer Science at the University of North Carolina at Chapel Hill.  He received a B.S. degree in Computer Science from Michigan State University in 1982, an M.S. degree in Computer Science from Purdue University in 1983, and a Ph.D. degree in Computer Sciences from the University of Texas at Austin in 1990. Prof. Anderson's main research interests are within the areas of concurrent and distributed computing, and real-time systems.

Speaker: Prof. James Anderson

Location: EB2 1231

Dates:
Feb 20, 2009 2:20 PM - 3:10 PM