• Linking and loading, Part 3

    November 3, 2011

    The linking loader can combine compiled programs into executables — files which can be loaded into memory and run. When invoked on a series of object files (files ending in the “.o” extension), the linking loader will concatenate the text sections of each of the files into a single larger text section, placing them into […]

  • Linking and loading, Part 2

    November 1, 2011

    An Experiment Here are three files, that are compiled separately and then brought together in a final link. The final link is done with a suggestion of laying the partial codes into memory in different orders. The placement in memory is checked using the nm utility. Running nm on f.o and g.o, they are compiled […]

  • Linking and loading

    November 1, 2011

    Compiled programs are prepared for running by a combination of softwares called the linker and loader. The edge between these two is blurry, and all unixes have a single program doing both, called ld. Why are we talking about linking-loaders at all? Recalling the discussion of what is an operating system, the linking-loader would be […]

  • Interval tree proof

    November 1, 2011

    An interval tree is a structure for organizing a set of intervals { i=[i.low,i.high] } so that the structure can be maintained dynamically, under insert of new intervals and deletion of existing intervals, and an intersection query can be answered efficiently. The intersection query is: given a query interval q = [q.low,q.high], return any interval […]

 
Powered by Wordpress and MySQL. Theme by Shlomi Noach, openark.org