Sharif Digital Repository

In assembly level programming we need to know the mnemonic of each assembly instruction. But it is not so easy to remember mnemonics of all instructions, while the instruction set of Pentium processor includes 280 instructions. In this paper we introduce a new programming approach to assembly level programming in which most important assembly instructions (about 100 instructions) can be substituted for simple equivalents. These equivalent instructions are based on simple familiar operators and make a large simplification in assembly programming. This new language has a free format structure and hence is called Free Format Assembly Language. Evaluating the performance of this language using a... 

In this paper, the parallel implementations of different iterative polynomial root finding methods on a processor with SIMD processing capability are reported. These methods are based on the construction of a sequence of approximations that converge to the set of roots. We have chosen four widely used methods namely Newton's, Durand-Kerner's, Aberth-Ehrlich's, and QD and implemented them using the SIMD instruction set of the Pentium processor with C++ and assembly language. Experiments show that a speedup of 3 or higher can be achieved, depending on the order of polynomial, required accuracy, and the method employed. © 2005 IEEE