Programming in C# Assemblies

Programming in C#   Assemblies

Assemblies



•Code contained in files called “assemblies”
–code and metadata
–.exe or .dll as before
–Executable needs a class with a “Main” method:
•public static void Main(string[] args)
–types
•local: local assembly, not accessible by others
•shared: well-known location, can be GAC
•strong names: use crypto for signatures
–then can add some versioning and trust  
 
PE executable file3
 
 
 

Comments

Post a Comment

Popular posts from this blog

Handling of Skew

Handling of Skew ô€‚„ The distribution of tuples to disks may be skewed — that is, some disks have many tuples, while others may have fewer tuples. ô€‚„ Types of skew: ô€ƒŒ Attribute-value skew. ô€‚¾ Some values appear in the partitioning attributes of many tuples; all the tuples with the same value for the partitioning attribute end up in the same partition. ô€‚¾ Can occur with range-partitioning and hash-partitioning. ô€ƒŒ Partition skew. ô€‚¾ With range-partitioning, badly chosen partition vector may assign too many tuples to some partitions and too few to others. ô€‚¾ Less likely with hash-partitioning if a good hash-function is chosen. Handling Skew in Range-Partitioning ô€‚„ To create a balanced partitioning vector (assuming partitioning attribute forms a key of the relation): ô€ƒŒ Sort the relation on the partitioning attribute. ô€ƒŒ Construct the partition vector by scanning the relation in sorted order as follows. ô€‚¾ After every 1/nth of the relation has been read, the value...
Read more

Fragment-and-Replicate Join

Fragment-and-Replicate Join ô€‚„ Partitioning not possible for some join conditions ô€ƒŒ e.g., non-equijoin conditions, such as r.A > s.B. ô€‚„ For joins were partitioning is not applicable, parallelization can be accomplished by fragment and replicate technique ô€ƒŒ Depicted on next slide ô€‚„ Special case – asymmetric fragment-and-replicate: ô€ƒŒ One of the relations, say r, is partitioned; any partitioning technique can be used. ô€ƒŒ The other relation, s, is replicated across all the processors. ô€ƒŒ Processor Pi then locally computes the join of ri with all of s using any join technique. ô€‚„ General case: reduces the sizes of the relations at each processor. ô€ƒŒ r is partitioned into n partitions,r0, r1, ..., r n-1;s is partitioned into m partitions, s0, s1, ..., sm-1. ô€ƒŒ Any partitioning technique may be used. ô€ƒŒ There must be at least m * n processors. ô€ƒŒ Label the processors as ô€ƒŒ P0,0, P0,1, ..., P0,m-1, P1,0, ..., Pn-1m-1. ô€ƒŒ Pi,j computes the join of ri with sj. In ...
Read more

Interquery Parallelism

Interquery Parallelism ô€‚„ Queries/transactions execute in parallel with one another. ô€‚„ Increases transaction throughput; used primarily to scale up a transaction processing system to support a larger number of transactions per second. ô€‚„ Easiest form of parallelism to support, particularly in a sharedmemory parallel database, because even sequential database systems support concurrent processing. ô€‚„ More complicated to implement on shared-disk or shared-nothing architectures ô€ƒŒ Locking and logging must be coordinated by passing messages between processors. ô€ƒŒ Data in a local buffer may have been updated at another processor. ô€ƒŒ Cache-coherency has to be maintained — reads and writes of data in buffer must find latest version of data. Cache Coherency Protocol ô€‚„ Example of a cache coherency protocol for shared disk systems: ô€ƒŒ Before reading/writing to a page, the page must be locked in shared/exclusive mode. ô€ƒŒ On locking a page, the page must be read from disk ...
Read more