83 research outputs found

    Enhancing parallelism by removing cyclic data dependencies

    Get PDF

    The FPT parallel programming environment

    No full text

    Research advances in the pathogenesis and surgical treatment of gallbladder carcinoma

    No full text
    Gallbladder carcinoma (GBC) is often obscured by some benign diseases in clinical practice and thus unsuspected GBC tends to occur. As for etiology, long-term stimulation by gallstones, gallbladder polyps larger than 1 cm, gallbladder adenoma, and adenomyomatosis of the gallbladder are closely associated with GBC. In the aspect of molecular biology, long non-coding RNA, microRNA, surface growth factor receptor, and some membrane proteins are involved in the development and progression of GBC, which may provide a reference for clinical practice. It is of great importance to perform intraoperative and postoperative surgical management of GBC, which is related to patients' survival. Patients with highly suspected or proven GBC should be converted to open surgery after disease assessment, in order to avoid reoperation. Reoperation should be performed for patients with unsuspected GBC found by postoperative pathological examination, in order to avoid tumor progression and metastasis

    Development of A Program Information Base for FPT Programming Environment

    No full text
    Introduction There are many efforts in parallel programming environments (PPE) for translating sequential program into parallel codes and for aiding programmers in writing parallel program efficiently and correctly. Examples are CASE [1], ParaScope [3], CEDAR [5], Parafrase [6], Tiny [7]. Because efficient parallel programs are difficultly to be obtained due to different program characteristics and asynchronous behaviours of the parallel parts, the user's experience and knowledge is necessary to parallelize a program with low overhead. The different program characteristics ask for different parallelizing strategies and algorithms. Many existing PPEs are not feasible to every application and computer architecture. Interactive user interface is useful for users to manipulate and parallelize their applications. Users can specify which dependence can be ignored and which can be transferred, what loop transformations are needed. As a result, the efficiency of the parallel program i

    Using hammock graphs to structure programs

    Get PDF
    Advanced computer architectures rely mainly on compiler optimizations for parallelization, vectorization, and pipelining. Efficient code generation is based on a control dependence analysis to find the basic blocks and to determine the regions of control. However, unstructured branch statements, such as jumps and goto’s, render the control flow analysis difficult, time-consuming, and result in poor code generation. Branches are part of many programming languages and occur in legacy and maintenance code as well as in assembler, intermediate languages, and byte code. A simple and effective technique is presented to convert unstructured branches into hammock graph control structures. Using three basic transformations, an equivalent program is obtained in which all control statements have a well-defined scope. In the interest of predication and branch prediction, the number of control variables has been minimized, thereby allowing a limited code replication. The correctness of the transformations has been proven using an axiomatic proof rule system. With respect to previous work, the algorithm is simpler and the branch conditions are less complex, making the program more readable and the code generation more efficient. Additionally, hammock graphs define single entry single exit regions and therefore allow localized optimizations. The restructuring method has been implemented into the parallelizing compiler FPT and allows to extract parallelism in unstructured programs. The use of hammock graph transformations in other application areas such as vectorization, decompilation, and assembly program restructuring is also demonstrated

    Using Hammock Graphs to Eliminate Nonstructured Branch Statements

    No full text
    The detection of parallelism is based on the dependence analysis of the program. One of the key problems is to partition the program into independent subtasks in the presence of control statements (MIMD). In this paper the nonstructured control statements are converted into structured ones. In this way, a large block of statements is obtained, and the control dependences of the program are easily converted into manageable parallel tasks

    Generating Parallel Loops from Serial Code for PVM

    No full text
    Enhancing high performance computing on distributed computers asks for a programming environment to help users write their parallel applications correctly, efficiently and easily. One of the open challenges for PVM is to generate parallel code from a serial program. In this contribution, a tool is presented to extract parallelism in loops with no loop-carried dependencies. Then code is generated to distribute computations and the data of the parallel loops over cooperating PVM computers

    Cooling Characteristics of the Hot-Rolled Seamless Steel Tube Impinged via Inclined Jet

    No full text
    The characteristics of flow field distribution and temperature variation of an inclined jet impinging on a steel tube surface at different positions in circumferential directions were studied via numerical simulation. By analyzing the local convective heat transfer coefficient in circumferential direction, it was shown that the downstream and upstream regions had the characteristics of typical asymmetry. As the inclination angle increases, the local convective heat transfer coefficient gradually increases in the downstream region and gradually decreases in the upstream region. When the θ of the top and bottom jet is 30°, the increases in the downstream region are 40.2% and 54.6%, respectively. Based on the study of the local convective heat transfer coefficient and temperature distribution in the circumfluence direction of a steel tube during the cooling process, it was shown that the optimal inclination angle is 0~10°. With the increase in inclination angle, the average heat transfer coefficient shows a decreasing trend overall. With the increase in jet Reynolds number, the decrease in the average heat transfer coefficient gradually decreases. When the inclination angle increases to 30°, the effect of inclination angle on steel tube cooling is obviously stronger than that of jet position
    • …
    corecore