No abstract

The tremendous storage space required for a useful data base of program traces has prompted a search for trace reduction techniques. In this paper we discuss a range of information-lossless address and instruction trace compression schemes that can reduce both storage space and access time by an order of magnitude or more, without discarding either references or inter-reference timing information from the original trace. The PDATS family of trace compression techniques achieves trace coding densities of about six references per byte. This family of techniques is now in use as the standard in the NMSU TraceBase, an extensive trace archive that has been established for use by the international research and teaching community.

No abstract

In this paper, we consider the problem of scheduling n independent jobs on m uniform parallel machines such that total weighted completion time is minimized. We present some metaheuristics to solve this problem. Based on a set of instances, a comparative study has been realized in order to evaluate these approaches.