Uji Performansi Kontrol Suhu dan Kelembaban Menggunakan Variasi Kontrol Digital dan Kontrol Scheduling untuk Pengawetan Buah dan Sayuran

Currently the preservation of fruit and vegetables in Indonesia is still done with traditional. Most post-harvest handling of fruits and vegetables in Indonesia directly sold into the market. So at harvest, the quantity of the commodity is abundant and when the time of harvest finished exhausted and rare commodity. In the fruit and vegetable preservation, temperature and relative humidity are two control variables that influence each other. Where the increase and decrease in temperature will result in changes in relative humidity. In this research carried out two variations control the digital control and control scheduling to determine the characteristics of the relationship of temperature and relative humidity . Results from both trials showed that the variation of the control of digital control has a good quick peak time to reach the set point temperature and humidity. While scheduling control humidity rise with the increase in temperature.      Keywords : Temperature, Relative Humidity, Fruits, Vegetables, preservation. Abstrak—Saat ini proses pengawetan buah dan sayuran di Indonesia masih dilakukan dengan cara tradisional. Banyak buah dan sayuran pasca panen langsung dijual ke pasar. Sehingga pada saat panen, kuantitas komoditi tersebut melimpah dan disaat waktu panen selesai komoditi tersebut habis dan langka. Pada pengawetan buah dan sayuran, suhu dan kelembaban relatif merupakan dua variabel kontrol yang saling mempengaruhi. Dimana kenaikan dan penurunan suhu akan berakibat pada perubahan kelembaban relatif. Pada penelitian kali ini dilakukan dua variasi kontrol yaitu kontrol digital dan kontrol scheduling untuk mengetahui karakteristik hubungan suhu dan kelembaban relatif. Hasil dari uji kedua variasi kontrol tersebut didapatkan bahwa kontrol digital memiliki waktu puncak yang cepat baik untuk mencapai set point suhu dan kelembaban. Sedangkan kontrol scheduling kenaikan kelembaban mengikuti kenaikan suhu.    Kata Kunci : Suhu, Kelembaban Relatif, Buah, Sayuran, Pengaweta

Bounded Delay Scheduling with Packet Dependencies

A common situation occurring when dealing with multimedia traffic is having large data frames fragmented into smaller IP packets, and having these packets sent independently through the network. For real-time multimedia traffic, dropping even few packets of a frame may render the entire frame useless. Such traffic is usually modeled as having {\em inter-packet dependencies}. We study the problem of scheduling traffic with such dependencies, where each packet has a deadline by which it should arrive at its destination. Such deadlines are common for real-time multimedia applications, and are derived from stringent delay constraints posed by the application. The figure of merit in such environments is maximizing the system's {\em goodput}, namely, the number of frames successfully delivered. We study online algorithms for the problem of maximizing goodput of delay-bounded traffic with inter-packet dependencies, and use competitive analysis to evaluate their performance. We present competitive algorithms for the problem, as well as matching lower bounds that are tight up to a constant factor. We further present the results of a simulation study which further validates our algorithmic approach and shows that insights arising from our analysis are indeed manifested in practice

Greedy Algorithms for Multi-Queue Buffer Management with Class Segregation

In this paper, we focus on a multi-queue buffer management in which packets of different values are segregated in different queues. Our model consists of m packets values and m queues. Recently, Al-Bawani and Souza (arXiv:1103.6049v2 [cs.DS] 30 Mar 2011) presented an online multi-queue buffer management algorithm Greedy and showed that it is 2-competitive for the general m-valued case, i.e., m packet values are 0 < v_{1} < v_{2} < ... < v_{m}, and (1+v_{1}/v_{2})-competitive for the two-valued case, i.e., two packet values are 0 < v_{1} < v_{2}. For the general m-valued case, let c_i = (v_{i} + \sum_{j=1}^{i-1} 2^{j-1} v_{i-j})/(v_{i+1} + \sum_{j=1}^{i-1}2^{j-1}v_{i-j}) for 1 \leq i \leq m-1, and let c_{m}^{*} = \max_{i} c_{i}. In this paper, we precisely analyze the competitive ratio of Greedy for the general m-valued case, and show that the algorithm Greedy is (1+c_{m}^{*})-competitive.Comment: 19 page

Inducing Thermal-Awareness in Multicore Systems Using Networks-on-Chip

Technology scaling imposes an ever increasing temperature stress on digital circuit design due to transistor density, especially on highly integrated systems, such as Multi- Processor Systems-on-Chip (MPSoCs). Therefore, temperature-aware design is mandatory and should be performed at the early design stages of MPSoCs to avoid iterations and delays in the deployment of final consumer products. In this paper we present a novel hardware infrastructure to provide thermal control of MPSoC architectures, which is based on exploiting the NoC interconnects of the baseline system as an active component to communicate and coordinate between temperature sensors scattered around the chip, in order to globally monitor the actual temperature of of the system. Then, a thermal management unit and clock frequency controllers are included as part of the active NoC-based thermal control infrastructure to adjust the frequency and voltage of the processing elements according to the temperature requirements of each MPSoC design at runtime. We show experimental results of the application of the proposed active NoC-based thermal management infrastructure to implement effective global temperature control policies for a real-life 4-core MPSoC, running real-life video processing benchmarks, emulated on an FPGA-based thermal emulation framework. Furthermore, due to the better thermal balancing of our proposed active NoC-based thermal control, the MPSoC performance improves almost 40% and achieves 45% energy savings with respect to local DVFS thermal control approaches

"Virtual malleability" applied to MPI jobs to improve their execution in a multiprogrammed environment"

This work focuses on scheduling of MPI jobs when executing in shared-memory multiprocessors (SMPs). The objective was to obtain the best performance in response time in multiprogrammed multiprocessors systems using batch systems, assuming all the jobs have the same priority. To achieve that purpose, the benefits of supporting malleability on MPI jobs to reduce fragmentation and consequently improve the performance of the system were studied. The contributions made in this work can be summarized as follows:· Virtual malleability: A mechanism where a job is assigned a dynamic processor partition, where the number of processes is greater than the number of processors. The partition size is modified at runtime, according to external requirements such as the load of the system, by varying the multiprogramming level, making the job contend for resources with itself. In addition to this, a mechanism which decides at runtime if applying local or global process queues to an application depending on the load balancing between processes of it. · A job scheduling policy, that takes decisions such as how many processes to start with and the maximum multiprogramming degree based on the type and number of applications running and queued. Moreover, as soon as a job finishes execution and where there are queued jobs, this algorithm analyzes whether it is better to start execution of another job immediately or just wait until there are more resources available. · A new alternative to backfilling strategies for the problema of window execution time expiring. Virtual malleability is applied to the backfilled job, reducing its partition size but without aborting or suspending it as in traditional backfilling. The evaluation of this thesis has been done using a practical approach. All the proposals were implemented, modifying the three scheduling levels: queuing system, processor scheduler and runtime library. The impact of the contributions were studied under several types of workloads, varying machine utilization, communication and, balance degree of the applications, multiprogramming level, and job size. Results showed that it is possible to offer malleability over MPI jobs. An application obtained better performance when contending for the resources with itself than with other applications, especially in workloads with high machine utilization. Load imbalance was taken into account obtaining better performance if applying the right queue type to each application independently.The job scheduling policy proposed exploited virtual malleability by choosing at the beginning of execution some parameters like the number of processes and maximum multiprogramming level. It performed well under bursty workloads with low to medium machine utilizations. However as the load increases, virtual malleability was not enough. That is because, when the machine is heavily loaded, the jobs, once shrunk are not able to expand, so they must be executed all the time with a partition smaller than the job size, thus degrading performance. Thus, at this point the job scheduling policy concentrated just in moldability.Fragmentation was alleviated also by applying backfilling techniques to the job scheduling algorithm. Virtual malleability showed to be an interesting improvement in the window expiring problem. Backfilled jobs even on a smaller partition, can continue execution reducing memory swapping generated by aborts/suspensions In this way the queueing system is prevented from reinserting the backfilled job in the queue and re-executing it in the future.Postprint (published version

Adaptive multimedia streaming control algorithm in wireless LANs and 4G networks

E-learning has become an important service offered over the Internet. Lately many users are accessing learning content via wireless networks and using mobile devices. Most content is rich media-based and often puts significant pressure on the existing wireless networks in order to support high quality of delivery. In this context, offering a solution for improving user quality of experience when multimedia content is delivered over wireless networks is already a challenging task. Additionally, to support this for mobile e-learning over wireless LANs becomes even more difficult. If we want to increase the end-used perceived quality, we have to take into account the users’ individual set of characteristics. The fact that users have subjective opinions on the quality of a multimedia application can be used to increase their QoE by setting a minimum quality threshold below which the connection is considered to be undesired. Like this, the use of precious radio resources can be optimized in order to simultaneously satisfy an increased number of users. In this thesis a new user-oriented adaptive algorithm based on QOAS was designed and developed in order to address the user satisfaction problem. Simulations have been carried out with different adaptation schemes to compare the performances and benefits of the DQOAS mechanism. The simulation results are showing that using a dynamic stream granularity with a minimum threshold for the transmission rate, improves the overall quality of the multimedia delivery process, increasing the total number of satisfied users and the link utilization The good results obtained by the algorithm in IEEE 802.11 wireless environment, motivated the research about the utility of the newly proposed algorithm in another wireless environment, LTE. The study shows that DQOAS algorithm can obtain good results in terms of application perceived quality, when the considered application generates multiple streams. These results can be improved by using a new QoS parameters mapping scheme able to modify the streams’ priority and thus allowing the algorithms decisions to not be overridden by the systems’ scheduler

"Virtual malleability" applied to MPI jobs to improve their execution in a multiprogrammed environment"

This work focuses on scheduling of MPI jobs when executing in shared-memory multiprocessors (SMPs). The objective was to obtain the best performance in response time in multiprogrammed multiprocessors systems using batch systems, assuming all the jobs have the same priority. To achieve that purpose, the benefits of supporting malleability on MPI jobs to reduce fragmentation and consequently improve the performance of the system were studied. The contributions made in this work can be summarized as follows:· Virtual malleability: A mechanism where a job is assigned a dynamic processor partition, where the number of processes is greater than the number of processors. The partition size is modified at runtime, according to external requirements such as the load of the system, by varying the multiprogramming level, making the job contend for resources with itself. In addition to this, a mechanism which decides at runtime if applying local or global process queues to an application depending on the load balancing between processes of it. · A job scheduling policy, that takes decisions such as how many processes to start with and the maximum multiprogramming degree based on the type and number of applications running and queued. Moreover, as soon as a job finishes execution and where there are queued jobs, this algorithm analyzes whether it is better to start execution of another job immediately or just wait until there are more resources available. · A new alternative to backfilling strategies for the problema of window execution time expiring. Virtual malleability is applied to the backfilled job, reducing its partition size but without aborting or suspending it as in traditional backfilling. The evaluation of this thesis has been done using a practical approach. All the proposals were implemented, modifying the three scheduling levels: queuing system, processor scheduler and runtime library. The impact of the contributions were studied under several types of workloads, varying machine utilization, communication and, balance degree of the applications, multiprogramming level, and job size. Results showed that it is possible to offer malleability over MPI jobs. An application obtained better performance when contending for the resources with itself than with other applications, especially in workloads with high machine utilization. Load imbalance was taken into account obtaining better performance if applying the right queue type to each application independently.The job scheduling policy proposed exploited virtual malleability by choosing at the beginning of execution some parameters like the number of processes and maximum multiprogramming level. It performed well under bursty workloads with low to medium machine utilizations. However as the load increases, virtual malleability was not enough. That is because, when the machine is heavily loaded, the jobs, once shrunk are not able to expand, so they must be executed all the time with a partition smaller than the job size, thus degrading performance. Thus, at this point the job scheduling policy concentrated just in moldability.Fragmentation was alleviated also by applying backfilling techniques to the job scheduling algorithm. Virtual malleability showed to be an interesting improvement in the window expiring problem. Backfilled jobs even on a smaller partition, can continue execution reducing memory swapping generated by aborts/suspensions In this way the queueing system is prevented from reinserting the backfilled job in the queue and re-executing it in the future