Claim Missing Document
Check
Articles

Found 4 Documents
Search
Journal : Edu Komputika Journal

EVALUASI METODE LOAD BALANCING Dan FAULT TOLERANCE PADA SISTEM DATABASE SERVER APLIKASI CHAT Hamka, Cakra Aminuddin; Adji, Teguh Bharata; Sulistyo, Selo
Edu Komputika Journal Vol 5 No 1 (2018): Edu Komputika Journal
Publisher : Jurusan Teknik Elektro Universitas Negeri Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Abstract The development of social network applications has growth so fast with various applications supported by smart tools as multiplatform to used it. Several applications that used by user are the chat and media social app. However, there is problem is the number of users accessing the chat service is large. This condition makes communication into database server can be stop and loss of data. It is caused by excessive load received by a single server database. Therefore, this study designs a database server to solve a lot of users of communication server and storage capacity into database server more than one. This is important because to increase availibiliy of services for each users request. This study used a method of distribution of communications service request for each database  server. Distribution of communication service request used a load balancing method and HAPRoxy with scheduling method. There are two algorithms in scheduling method are round robin and least connection algorithm. Both of algorithms were evaluated. compared, and used in database server more than one. The result shown average of least connection algorithm has value of response time 32.421 ms is smaller than round robin algorithm 35.813 ms. While on the throughput, least algorithm has big value 211.267 Kb/s than round robin algorithm has value 210.298 Kb/s. The result shown the number of packet least connection algorithm are big and better than round robin algortihm with load balancing implementation for distribution of server communication on database server more than one able to solve a lot of services communication. Keywords: load balancing, database server chat, least connection, round robin, response time, throughput
Rekomendasi Berdasarkan Nilai Pretest Mahasiswa Menggunakan Metode Collaborative Filtering dan Bayesian Ranking Stefani, Brillian; Adji, Teguh Bharata; Kusumawardani, Sri Suning; Hidayah, Indriana
Edu Komputika Journal Vol 5 No 1 (2018): Edu Komputika Journal
Publisher : Jurusan Teknik Elektro Universitas Negeri Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Abstract- Self-Regulated Learning (SRL) skill can be improved by improving students’ cognitive and metacognitive abilities. To improve metacognitive abilities, metacognitive support in learning process using e-learning needs to be included. One of the example is assisting students by giving feedbacks once students had finished doing specific avtivities. The purpose of this study was to develop a pedagogical agent with the abilities to give students feedbacks, particularly recommendations of lesson sub-materials order. Recommendations were given by considering students pretest scores (students’ prior knowledge). The computations for recommendations used Collaborative Filtering and Bayesian Ranking methods. Results obtained in this study show that based on MAP (Mean Average Precision) testings, Item-based method got the highest MAP score, which was 1. Computation time for each method was calculated to find runtime complexity of each method. The results of computation time show that Bayesian Ranking had the shortest computation time with 0,002 seconds, followed by Item-based with 0,006 seconds, User Based with 0,226 seconds, while Hybrid has the longest computation time with 0,236 seconds. Keyword- self-regulated learning, metacognitive, metacognitive support, feedback, pretest (prior knowledge), Collaborative Filtering, Bayesian Ranking, Mean Average Precision, runtime complexity.
EVALUASI METODE LOAD BALANCING Dan FAULT TOLERANCE PADA SISTEM DATABASE SERVER APLIKASI CHAT Hamka, Cakra Aminuddin; Adji, Teguh Bharata; Sulistyo, Selo
Edu Komputika Journal Vol 5 No 1 (2018): Edu Komputika Journal
Publisher : Jurusan Teknik Elektro Universitas Negeri Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15294/edukomputika.v5i1.23029

Abstract

Abstract The development of social network applications has growth so fast with various applications supported by smart tools as multiplatform to used it. Several applications that used by user are the chat and media social app. However, there is problem is the number of users accessing the chat service is large. This condition makes communication into database server can be stop and loss of data. It is caused by excessive load received by a single server database. Therefore, this study designs a database server to solve a lot of users of communication server and storage capacity into database server more than one. This is important because to increase availibiliy of services for each users request. This study used a method of distribution of communications service request for each database server. Distribution of communication service request used a load balancing method and HAPRoxy with scheduling method. There are two algorithms in scheduling method are round robin and least connection algorithm. Both of algorithms were evaluated. compared, and used in database server more than one. The result shown average of least connection algorithm has value of response time 32.421 ms is smaller than round robin algorithm 35.813 ms. While on the throughput, least algorithm has big value 211.267 Kb/s than round robin algorithm has value 210.298 Kb/s. The result shown the number of packet least connection algorithm are big and better than round robin algortihm with load balancing implementation for distribution of server communication on database server more than one able to solve a lot of services communication. Keywords: load balancing, database server chat, least connection, round robin, response time, throughput
Rekomendasi Berdasarkan Nilai Pretest Mahasiswa Menggunakan Metode Collaborative Filtering dan Bayesian Ranking Stefani, Brillian; Adji, Teguh Bharata; Kusumawardani, Sri Suning; Hidayah, Indriana
Edu Komputika Journal Vol 5 No 1 (2018): Edu Komputika Journal
Publisher : Jurusan Teknik Elektro Universitas Negeri Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15294/edukomputika.v5i1.23077

Abstract

Abstract- Self-Regulated Learning (SRL) skill can be improved by improving students’ cognitive and metacognitive abilities. To improve metacognitive abilities, metacognitive support in learning process using e-learning needs to be included. One of the example is assisting students by giving feedbacks once students had finished doing specific avtivities. The purpose of this study was to develop a pedagogical agent with the abilities to give students feedbacks, particularly recommendations of lesson sub-materials order. Recommendations were given by considering students pretest scores (students’ prior knowledge). The computations for recommendations used Collaborative Filtering and Bayesian Ranking methods. Results obtained in this study show that based on MAP (Mean Average Precision) testings, Item-based method got the highest MAP score, which was 1. Computation time for each method was calculated to find runtime complexity of each method. The results of computation time show that Bayesian Ranking had the shortest computation time with 0,002 seconds, followed by Item-based with 0,006 seconds, User Based with 0,226 seconds, while Hybrid has the longest computation time with 0,236 seconds. Keyword- self-regulated learning, metacognitive, metacognitive support, feedback, pretest (prior knowledge), Collaborative Filtering, Bayesian Ranking, Mean Average Precision, runtime complexity.