In shared-memory bus-based multiprocessors, when the number of processors grows, the processors spend an increasing amount of time waiting for access to the bus (and shared memory). This contention reduces the perform...
This research work considers a scenario of cloud computing job-shop scheduling problems. We consider rn realtime jobs with various lengths and n machines with different computational speeds and costs. Each job has a d...
This research covers the Intel? Direct Sparse Solver for Clusters, the software that implements a direct method for solving the Ax = b equation with sparse symmetric matrix A on a cluster. This method, researched by I...
supported in part by Spanish Government and European ERDF under Grant Nos. TIN2007-66423, TIN2010-21291-C02-01 and TIN2007-60625;gaZ:T48 research group (Arag'on Government and European ESF);Consolider CSD2007-00050 (Spanish Government);HiPEAC-2 NoE (European FP7/ICT 217068)
Synchronization in parallel programs is a major performance bottleneck in multiprocessor systems. Shared data is protected by locks and a lot of time is spent on the competition arising at the lock hand-off. In order ...
supported by the National Natural Science Foundation of China under Grant Nos. 60970108,60970107;the Scienceand Technology Commission of Shanghai Municipality under Grant Nos. 09510701600,10DZ1500200,10511500102;IBM SUR Funding;IBM Research-China JP Funding
Noticeable performance improvement via ever-increasing transistors is gradually trapped into a predicament since software cannot logically and efficiently utilize hardware resource, such as multi-core resource. This i...
Supported by National Natural Science Foundation ofChina (No.60873112)
This paper proposes an object oriented model scheduling for parallel computing in media MultiProcessors System on Chip(MPSoC).Firstly,the Coarse Grain Data Flow Graph(CGDFG) parallel programming model is used in this ...
Project supported by the National Natural Science Foundation of0 China (Nos. 60274011 and 60574067), and the Program for NewCentury Excellent Talents in University (No. NCET-04-0094), China
The Fork-Join program consisting of K parallel tasks is a useful model for a large number of computing applications. When the parallel processor has multi-channels, later tasks may finish execution earlier than their ...
This work is supported by the Natural Science Foundation of Henan (No.0211021600, No.0324220079) and the Fundamental Researches of Henan (No.004061800).