I'm looking for some examples of actions on Sylow p-groups, and often those actions appear in the case of finite almost simple groups. Given a finite almost simple group, I understand in principle how to calculate its Sylow p-subgroups (here p is usually 2 or 3), but perhaps I am just too slow at doing it. In particular, I am familiar with the papers of Weir and Carter-Fong.

I am not sure how to do the reverse calculation: given a p-group P (possibly described as "the Sylow p-subgroup of the almost simple group X", and X is something explicit like "PGL(3,19)" or "M11"), find all of the almost simple groups that have a Sylow p-subgroup isomorphic to P.

I am pretty sure some people know how to do this, but it's not really clear to me how to go about it. For instance, it would have never occurred to me that PSU(3,8), PSL(3,19), and ^{3}D_{4}(2) have isomorphic Sylow 3-subgroups.

Is there a description of how this is done?

I think there is likely to be a finite answer to the question: Obviously only finitely many (and probably O(p)) alternating groups could work for a given P. We take for granted that only finitely many sporadic groups could work. It seems that, similarly to the alternating case, there are only finitely many ranks (again probably O(p)) of Lie groups that could work, and hopefully for each Lie type (and rank), there are just some congruences on "q" that indicate which ones work and which don't.

However, I've not had much luck doing this calculation in examples, and so I am looking for papers or textbooks where this has been done. I have found some that state the result of doing something like this (post CFSG), and I have found several that do this in quite some detail, but pre-CFSG so they spend hundreds of pages eliminating impossible groups obscuring what should now be an easy calculation. I'm looking for something with the pedagogical style of the pre-CFSG papers, but that doesn't mind using the standard 21st century tools.

Alternatively: does anyone know of a vaguely feasible approach to construct all groups with given Sylow subgroups? Blackburn et al.'s Enumerating book has some upper bounds, but they are pretty outrageous and don't seem adaptable to a feasible algorithm for my problem.