Filters








548,832 Hits in 5.0 sec

Link-Time Improvement of Scheme Programs [chapter]

Saumya Debray, Robert Muth, Scott Watterson
1999 Lecture Notes in Computer Science  
Experiments indicate that signi cant performance improvements are possible via link-time optimization even when the input programs have already been subjected to high levels of compile-time optimization  ...  A possible solution is to carry out (additional) program optimization at link time.  ...  Thanks are also due to Suresh Jagannathan for providing some of the benchmarks.  ... 
doi:10.1007/978-3-540-49051-7_6 fatcat:g36xmd53rvaqre644vxyjieowy

Register windows vs. register allocation

D. W. Wall
1988 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation - PLDI '88  
These included compile-time and link-time schemes for allocating 52 registers, and register window schemes using 128 registers organized into fixed-size or variable-sized windows.  ...  , and the cycle time can therefore be kept as small as possible, resulting in faster programs overall.  ...  The object modules are annotated with a description of how r c each instruction uses the variables and procedures of the program. At link time, the allocato onstructs a summary of the entire program.  ... 
doi:10.1145/53990.53997 dblp:conf/pldi/Wall88 fatcat:gcggjgeo45htxp6mpu3cfp7pg4

Register windows vs. register allocation

D. W. Wall
1988 SIGPLAN notices  
These included compile-time and link-time schemes for allocating 52 registers, and register window schemes using 128 registers organized into fixed-size or variable-sized windows.  ...  , and the cycle time can therefore be kept as small as possible, resulting in faster programs overall.  ...  The object modules are annotated with a description of how r c each instruction uses the variables and procedures of the program. At link time, the allocato onstructs a summary of the entire program.  ... 
doi:10.1145/960116.53997 fatcat:dc72ac22wrhwjl62e2dm3ov4vu

Register windows vs. register allocation

David W. Wall
2004 SIGPLAN notices  
These included compile-time and link-time schemes for allocating 52 registers, and register window schemes using 128 registers organized into fixed-size or variable-sized windows.  ...  , and the cycle time can therefore be kept as small as possible, resulting in faster programs overall.  ...  The object modules are annotated with a description of how r c each instruction uses the variables and procedures of the program. At link time, the allocato onstructs a summary of the entire program.  ... 
doi:10.1145/989393.989422 fatcat:wvu4iefebrapzi6x73h2ialoma

Delay-Aware Program Codes Dissemination Scheme in Internet of Everything

Yixuan Xu, Anfeng Liu, Changqin Huang
2016 Mobile Information Systems  
Theoretical analysis and experimental results show that, compared with previous work, DAPD scheme improves the dissemination performance in terms of completion time, transmission cost, and the efficiency  ...  Therefore, DAPD scheme improves the performance of bulk codes dissemination through the following two aspects. (1) Due to the fact that a high transmitting power can significantly improve the quality of  ...  The main contributions of the DAPD scheme are listed as follows. (1) DAPD scheme enhances transmitting power of sensors with excess energy to improve link quality and reduce Mobile Information Systems  ... 
doi:10.1155/2016/2436074 fatcat:xvxkdumumbactdjsz7ufg3gx74

Robust improvement schemes for road networks under demand uncertainty

Yafeng Yin, Samer M. Madanat, Xiao-Yun Lu
2009 European Journal of Operational Research  
In this paper, three optimization models, sensitivity-based, scenario-based and min-max, are proposed for determining robust optimal improvement schemes that can improve the performance of a network while  ...  at the same time allowing it to remain "close" to the designated level under any realization of the uncertain demand.  ...  The contents of this paper reflect the views of the authors, who are responsible for the facts and the accuracy of the data presented herein.  ... 
doi:10.1016/j.ejor.2008.09.008 fatcat:jfumraqoevd5bc6vwlgequzpia

Real-time QoS Routing Scheme in SDN-based Robotic Cyber-Physical Systems [article]

Rutvij H. Jhaveri, Rui Tan, Sagar V. Ramani
2020 arXiv   pre-print
We exploit the SDN capabilities to dynamically select paths based on current link parameters in order to improve the QoS in such delay-constrained networks.  ...  In this paper, we propose an SDN-based routing mechanism which attempts to improve QoS in robotic cyber-physical systems which have hard real-time requirements.  ...  within the Delta-NTU Corporate Laboratory for Cyber-Physical Systems with funding support from Delta Electronics Inc. and the National Research Foundation (NRF), Singapore under the Corp Lab @ University Scheme  ... 
arXiv:2004.04466v1 fatcat:aag5buvamjefhgvgplyuuyd66m

A high-performance memory allocator for memory intensive applications

J.M. Chang, Y. Hasan, W.H. Lee
2000 Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region  
Compare to the average performance of wellknown algorithms, the profile-based approach is about 3.9 times to 6.5 times faster.  ...  This paper presents a profile-based strategy to improve the performance of DMM. The performance improvement comes from a segregated strategy without splitting and coalescing cost.  ...  The average improvement of realloc is 2.7 times. Figure 4. realloc comparison graph Another noticeable improvement of CHL algorithm is in the free() function.  ... 
doi:10.1109/hpc.2000.846507 fatcat:bcaacn4qpracpmd7e5bwqpm2rq

Transportation Network Design considering Morning and Evening Peak-Hour Demands

Hua Wang, Gui-Yuan Xiao, Li-Ye Zhang, Yangbeibei Ji
2014 Mathematical Problems in Engineering  
of improved links.  ...  The NDP problem is formulated as a bilevel programming model, where the upper level is to minimize the weighted sum of total travel time for network users travelling in both morning and evening commute  ...  Acknowledgments This study is supported by a program for new century excellent talents in university (Grant no.  ... 
doi:10.1155/2014/806916 fatcat:wyge3yastne5hcqs6uvej7bwyi

Joint road toll pricing and capacity development in discrete transport network design problem

Meng Xu, Guangmin Wang, Susan Grant-Muller, Ziyou Gao
2016 Transportation  
A general discrete network design problem with a road toll pricing scheme, to minimize the total travel time under a budget constraint, is proposed.  ...  The paper demonstrates a method to determine road network improvements that also involve the use of a road toll charge, taking the perspective of the government or authority.  ...  fixed travel demand assumption, the new links added can reduce the total travel time and improve the level of transport service.  ... 
doi:10.1007/s11116-015-9674-2 fatcat:mmj2heagbjh7xehkkkzx3v47i4

Performance improvements of differential operators code for MPS method on GPU

Kohei Murotani, Issei Masaie, Takuya Matsunaga, Seiichi Koshizuka, Ryuji Shioya, Masao Ogino, Toshimitsu Fujisawa
2015 Computational Particle Mechanics  
In the improvements of particle search, bucket loops of the cell-linked list are changed to a loop structure having fewer local variables and the linked list and the forward star of particle search algorithms  ...  By these improvements, a performance efficiency of 24.7 % can be achieved for the first-order polynomial approximation scheme using NVIDIA Tesla K20, CUDA-6.5, and doubleprecision floating-point operations  ...  ., and all the members of the ADVENTURE project for their cooperation.  ... 
doi:10.1007/s40571-015-0059-2 fatcat:a2wufw4l6jav3eaknaufhqp3la

Improving the Data Scheduling Efficiency of the IEEE 802.16(d) Mesh Network

Shie-Yuan Wang, Chih-Che Lin, Ku-Han Fang
2008 IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference  
To address this problem, in this paper we propose three schemes to improve the data scheduling efficiency of the DS mode of the IEEE 802.16(d) mesh network.  ...  Our simulation results show that network performances and qualities experienced by application programs are significantly improved under our schemes.  ...  Besides, the MG scheme also reduces the packet delay time experienced by application programs, as compared with the basic scheme.  ... 
doi:10.1109/glocom.2008.ecp.989 dblp:conf/globecom/WangLF08 fatcat:z7kspza6xzdgxa7d3hmxqcokoi

DPLC: Dynamic Packet Length Control in Wireless Sensor Networks

Wei Dong, Xue Liu, Chun Chen, Yuan He, Gong Chen, Yunhao Liu, Jiajun Bu
2010 2010 Proceedings IEEE INFOCOM  
To make DPLC more efficient in terms of channel utilization, we incorporate a lightweight and accurate link estimation method that captures both physical channel conditions and interferences.  ...  ., small message aggregation and large message fragmentation, to facilitate upper-layer application programming.  ...  DPLC should provide a dynamic adaptation scheme to achieve performance improvements in dynamic, time-varying sensor networks. • Accurate link estimation.  ... 
doi:10.1109/infcom.2010.5462063 dblp:conf/infocom/DongLCHCLB10 fatcat:rcq2gxgwz5de7gijq2tkabifmi

SDR-Based Experiments for LTE-LAA Based Coexistence Systems with Improved Design

Yao Ma, Ryan Jacobs, Daniel G. Kuester, Jason Coder, William Young
2017 GLOBECOM 2017 - 2017 IEEE Global Communications Conference  
These results provide not only a more robust LAA-LBT design, but also a new method of SDR programming and testing, and insight into the coexistence performance of heterogeneous systems.  ...  We program the improved LBT algorithm in the SDR field-programmable gate array (FPGA), and compare the results with the original LBT algorithm.  ...  We have programmed the new LBT scheme in an FPGA, and implemented testing on coexisting LAA and WLAN links using SDR devices.  ... 
doi:10.1109/glocom.2017.8254615 dblp:conf/globecom/MaJKCY17 fatcat:ndsdkpxpnndy5ht44m2dzeji6i

Managing Rush Hour Congestion with Lane Reversal and Tradable Credits

Qing Li, Ziyou Gao
2014 Mathematical Problems in Engineering  
On the other hand, an effective tradable credit scheme can help to reduce the traffic demand and improve fairness for all travelers.  ...  The traveler at the lower level chooses the optimal route on the basis of both travel time and credit charging for the lanes involved.  ...  Acknowledgments This study was jointly supported by the National Basic Research Program of China (2012CB725401) and the National Natural Science Foundation of China (71271205 and 71322102).  ... 
doi:10.1155/2014/132936 fatcat:rdmzasijlfck5fc3dalm76douy
« Previous Showing results 1 — 15 out of 548,832 results