초록 ▼

A large distributed enterprise includes computing resources including a management server servicing a plurality of endpoint machines. A management infrastructure include a runtime engine is deployed on given endpoint machines. In response to a task deployment request at an administrative server, dis

A large distributed enterprise includes computing resources including a management server servicing a plurality of endpoint machines. A management infrastructure include a runtime engine is deployed on given endpoint machines. In response to a task deployment request at an administrative server, discovery agents may be launched into the computer network. When a software agent arrives at a given machine that supports the runtime engine, the agent is executed to determine whether the endpoint is a candidate for a particular task deployment.

대표청구항 ▼

A large distributed enterprise includes computing resources including a management server servicing a plurality of endpoint machines. A management infrastructure include a runtime engine is deployed on given endpoint machines. In response to a task deployment request at an administrative server, dis

A large distributed enterprise includes computing resources including a management server servicing a plurality of endpoint machines. A management infrastructure include a runtime engine is deployed on given endpoint machines. In response to a task deployment request at an administrative server, discovery agents may be launched into the computer network. When a software agent arrives at a given machine that supports the runtime engine, the agent is executed to determine whether the endpoint is a candidate for a particular task deployment. ut bits, said second set of input bits being a subset of said whole set of input bits, and said third number being derived from the product of said third coefficient and a curve-fit function of a second translation of a third set of input bits, said third set of input bits being a subset of said whole set of input bits wherein said first translation is the two's-complement of said second set of input bits. 2. A function calculator, comprising: a look-up table, said look-up table outputting a first coefficient, a second coefficient, and a third coefficient in response to a first set of input bits, said first set of input bits being a subset of a whole set of input bits; an adder, said adder producing a result that is the sum of a first number, a second number, and a third number, said first number being derived from said first coefficient, said second number being derived from the product of said second coefficient and a first translation of a second set of input bits, said second set of input bits being a subset of said whole set of input bits, and said third number being derived from the product of said third coefficient and a curve-fit function of a second translation of a third set of input bits, said third set of input bits being a subset of said whole set of input bits wherein said second translation is the inversion of the most significant bit of said third set of input bits. 3. A function calculator, comprising: a look-up table, said look-up table outputting a first coefficient, a second coefficient, and a third coefficient in response to a first set of input bits, said first set of input bits being a subset of a whole set of input bits; an adder, said adder producing a result that is the sum of a first number, a second number, and a third number, said first number being derived from said first coefficient, said second number being derived from the product of said second coefficient and a first translation of a second set of input bits, said second set of input bits being a subset of said whole set of input bits, and said third number being derived from the product of said third coefficient and a curve-fit function of a second translation of a third set of input bits, said third set of input bits being a subset of said whole set of input bits wherein said first translation is the two's-complement said second set of input bits and said second translation is the inversion of the most significant bit of said third set of input bits and wherein said second set of inputs bits and said third set of inputs bits are the same bits. 4. The function calculator of claim 3 wherein said first set of input bits are more significant than said second set of input bits. 5. The function calculator of claim 4 wherein the contents of said look-up table are chosen to produce said result that is an approximation, to a predetermined number of significant bits, of the reciprocal of said whole set of input bits. 6. The function calculator of claim 4 wherein the contents of said look-up table are chosen to produce said result that is an approximation, to a predetermined number of significant bits, of the reciprocal of the square root of said whole set of input bits. 7. A method of function generation, comprising: looking-up a first coefficient, a second coefficient, and a third coefficient in response to a first set of input bits, said first set of input bits being a subset of a whole set of input bits; adding, a first number, a second number, and a third number to produce a result that is an approximation of the result of a mathematical function being performed on said whole set of input bits, said first number being derived from said first coefficient, said second number being derived from the product of said second coefficient and a first translation of a second set of input bits, said second set of input bits being a subset of said whole set of input bits, and said third number being derived from the product of said third co efficient and a curve-fit function of a second translation of a third set of input bits, said third set of input bits being a subset of said whole set of input bits wherein said first translation is the two's-complement said second set of input bits. 8. A method of function generation, comprising: looking-up a first coefficient, a second coefficient, and a third coefficient in response to a first set of input bits, said first set of input bits being a subset of a whole set of input bits; adding, a first number, a second number, and a third number to produce a result that is an approximation of the result of a mathematical function being performed on said whole set of input bits, said first number being derived from said first coefficient, said second number being derived from the product of said second coefficient and a first translation of a second set of input bits, said second set of input bits being a subset of said whole set of input bits, and said third number being derived from the product of said third coefficient and a curve-fit function of a second translation of a third set of input bits, said third set of input bits being a subset of said whole set of input bits wherein said second translation is the inversion of the most significant bit of said third set of input bits. 9. A method of function generation, comprising: looking-up a first coefficient, a second coefficient, and a third coefficient in response to a first set of input bits, said first set of input bits being a subset of a whole set of input bits; adding, a first number, a second number, and a third number to produce a result that is an approximation of the result of a mathematical function being performed on said whole set of input bits, said first number being derived from said first coefficient, said second number being derived from the product of said second coefficient and a first translation of a second set of input bits, said second set of input bits being a subset of said whole set of input bits, and said third number being derived from the product of said third coefficient and a curve-fit function of a second translation of a third set of input bits, said third set of input bits being a subset of said whole set of input bits wherein said first translation is the two's-complement of said second set of input bits and said second translation is the inversion of the most significant bit of said third set of input bits and wherein said second set of inputs bits and said third set of inputs bits are the same bits. 10. The method of claim 9 wherein said first set of input bits are more significant than said second set of input bits. 11. The method of claim 10 wherein the coefficients produced by said looking-up are chosen to produce said result that is an approximation, to a predetermined number of significant bits, of the reciprocal of said whole set of input bits. 12. The method of claim 10 wherein the coefficients produced by said looking-up are chosen to produce said result that is an approximation, to a predetermined number of significant bits, of the reciprocal of the square root of said whole set of input bits. 13. A function generator, comprising: a look-up table, said look-up table outputting a first coefficient, a second coefficient, and a third coefficient in response to a first set of input bits, said first set of input bits being a subset of a whole set of input bits; an adder, said adder producing a result that is the sum of a first number, a second number, and a third number, said first number being derived from said first coefficient; a first multiplier, said first multiplier producing said second number, said second number being the result of said second coefficient and a first translation of a second set of input bits being input to said first multiplier, said second set of input bits being a subset of said whole set of input bits; a second multiplier, said second multiplier producing said third number, said third n