On 05/17/2018 11:57 AM, Michael Pelletier wrote: > Good explanation, Tom - one could envision a submit tool that checks for vector instructions in an executable and generates a rank expression to prefer the highest compatible instruction set and require the minimum. That is, assuming the executable isn't a wrapper script. And the even more general problem is called an "undecidable problem". Unix `file` program, in the pathological case, has to read the entire file to determine if it contains any "unprintable" bytes ("binary file") or not ("text file"). Your tool would have to read the entire binary, with all its DDLs to figure out the "maximum" required set of instructions. As Tom said, you can't know if a given instruction is reachable with given inputs (think exception handling code) and so your tool can't decide if the job will complete on the "minimum" set. -- Dimitri Maziuk Programmer/sysadmin BioMagResBank, UW-Madison -- http://www.bmrb.wisc.edu
Attachment:
signature.asc
Description: OpenPGP digital signature