1. A computer-implemented method for performing structure layout optimization of a data structure comprising a set of data fields in a multi-threaded environment, comprising: determining a set of code concurrency values, each of said code concurrency values being indicative of potential false sharing among said set of data fields; calculating a set of cycle gain values, each of said cycle gain values being indicative of spatial locality between a pair of said data fields; employing said set of cycle gain values and said set of code concurrency values to create a field layout graph, said field layout graph being configured to illustrate relationships between said set of data fields of said data structure; and employing a cluster algorithm to said field layout graph to create a set of clusters, each cluster of said set of clusters being employed to generate a cache line.