Mahadevan Balasubramaniam

According to our database1, Mahadevan Balasubramaniam authored at least 12 papers between 2000 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Robustness Prediction and Evaluation of Divisible Load Scheduling on Computing Systems with Unpredictable Variations.
Proceedings of the IEEE 13th International Symposium on Parallel and Distributed Computing, 2014

Scalability Analysis and Evaluation of Divisible Load Scheduling.
Proceedings of the 43rd International Conference on Parallel Processing Workshops, 2014

2013
Analyzing the Robustness of Scheduling Algorithms Using Divisible Load Theory on Heterogeneous Systems.
Proceedings of the IEEE 12th International Symposium on Parallel and Distributed Computing, 2013

Scheduling Data Parallel Workloads - A Comparative Study of Two Common Algorithmic Approaches.
Proceedings of the 42nd International Conference on Parallel Processing, 2013

2012
Towards the Scalability of Dynamic Loop Scheduling Techniques via Discrete Event Simulation.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

2005
Design and implementation of a novel dynamic load balancing library for cluster computing.
Parallel Comput., 2005

Performance evaluation of a dynamic load-balancing library for cluster computing.
Int. J. Comput. Sci. Eng., 2005

Overhead Analysis of a Dynamic Load Balancing Library for Cluster Computing.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

2004
A Novel Dynamic Load Balancing Library for Cluster Computing.
Proceedings of the 3rd International Symposium on Parallel and Distributed Computing (ISPDC 2004), 2004

2003
Collision-free finishing toolpaths from visibility data.
Comput. Aided Des., 2003

2002
Generation of collision-free 5-axis tool paths using a haptic surface.
Comput. Aided Des., 2002

2000
Generating 5-axis NC roughing paths directly from a tessellated representation.
Comput. Aided Des., 2000


  Loading...