Hello fellow Academic Community members,
So what exactly is Septembers Microgrant topic Data Structures about? Asked another way, to apply for a Microgrant of up to $5000 USD do you have to be teaching an actual class called data structures?
Well, Im glad you asked!!! And the short answer is, absolutely NOT.
To apply for a Microgrant this month (deadline September 30, 2011) you simply have to be writing or improving course materials for ANY course in which you are teaching (or will teach)parallelism in programming, and, more specifically, material in which your students intend to successfully implement data structures in parallel code.
If youre currently wondering if specific content youd like to submit for a Microgrant award fit into our category this month, the Microgrant team recommends you first examine the ACM Data Structures-specific guidelines, here. If youd like a little more guidance than that, consider these more general guidelines for the appropriate ACM listings:
- Discreet Structures/GraphsAndTrees (Trees, Undirected graphs, Directed graphs, Spanning trees/forests, and Traversal strategies.) Guideline: OK, these might be somewhat basic in the scheme of things, but still, putting them into a parallel framework would be great, and completely on topic this month.
- Programming Fundamentals/DataStructures (Representation of numeric data; Range, precision, and rounding errors; Arrays; Representation of character data; Strings and string processing; Runtime storage management; Pointers and references; Linked structures; Implementation strategies for stacks, queues, and hash tables; Implementation strategies for graphs and trees; Strategies for choosing the right data structure.) Guideline: OK, once again, might be somewhat basic for some of your current curriculum needs, but as the above, putting them into a parallel framework would be excellent, and therefore completely on topic this month.
- Other possible topics could include data structure models as part of a parallel language, implementing non-blocking (lock-free, wait-free, obstruction-free) data structures, or new data structures that take advantage of parallelism. (New is good!)
- And frankly, there are probably other topics the Microgrant team hasnt considered yet that would absolutely apply, but would no doubt use some kind of data holding object (in some structure format) that can be used (safely) within a parallel algorithm/code.
If you consider all this and youre still not sure if you should apply for a Microgrant, go ahead and apply! (What do you have to lose?)
And please remember, if youre currently writing or updating parallelism topics OTHER than Data Structures, be sure to check back regularly at the Microgrant web site. Accepted topics change monthly and you can apply as often as youd like.